•:• Computational Geometry Theory and Applications ELSEVIER Computational Geometry 10 (1998) 321-332 Master index of Volumes 1-10 Agarwal, EK. and M. Sharir, Off-line dynamic maintenance of the width of a planar point set 1 (1991) 65- 78 Agarwal, P.K., J. Matou~ek and S. Suri, Farthest neighbors, maximum spanning trees and related problems in higher dimensions 1 (1991) Agarwal, EK. and J. Matou~ek, Relative neighborhood graphs in three dimensions 2 (1992) Agarwal, EK., On stabbing lines for convex polyhedra in 3D 4 (1994) Agarwal, EK., M.J. Katz and M. Sharir, Computing depth orders for fat objects and related problems 5 (1995) Akutsu, T., On determining the congruence of point sets in d dimensions 9 (1998) Allen, S. and D. Dutta, Wall thickness control in layered manufacturing for surfaces with closed slices 10 (1998) Alsuwaiyel, M.H. and D.T. Lee, Minimal link visibility paths inside a simple polygon 3 (1993) Alt, H., M. Godau and S. Whitesides, Universal 3-dimensional visibility representations for graphs 9 (1998) Anagnostou, E. and D. Corneil, Polynomial-time instances of the Minimum Weight Triangulation problem 3 (1993) Andersson, A. and K. Swanson, On the difficulty of range searching 8 (1997) Andrews, M.G. and D.T. Lee, Parallel algorithms on circular-arc graphs 5 (1995) Arkin, E.M., P. Belleville, J.S.B. Mitchell, D. Mount, K. Romanik, S. Salzberg and D. Souvaine, Testing simple polygons 8 (1997) 97-114 Arkin, E.M., M. Held, J.S.B. Mitchell and S.S. Skiena, Recognizing polygonal parts from width measurements 9 (1998) Aronov, B., R. Seidel and D. Souvaine, On compatible triangulations of simple polygons 3 (1993) Aronov, B. and M. Sharir, The common exterior of convex polygons in the plane 8 (1997) Asano, T. and N. Katoh, Variants for the Hough transform for line detection 6 (1996) Atallah, M.J. and D.Z. Chen, Parallel rectilinear shortest paths with rectangular obstacles 1 (1991) Atallah, M.J. and D.Z. Chen, On parallel rectilinear obstacle-avoiding paths 3 (1993) Atallah, M.J. and A. Fabri, On the multisearching problem for hypercubes 5 (1995) Attali, D., r-regular shape reconstruction from unorganized points 10 (1998) Avgustinovich, S.V. and S.V. Sevast'janov, Vector summation within minimal angle 2 (1992) Avis, D., E Erd6s and J. Pach, Distinct distances determined by subsets of a point set in space 1 (1991) Avis, D. and V.P. Grishukhin, A bound on the k-gonality of facets of the hypermetric cone and related complexity problems 2 (1992) Avis, D., D. Bremner and R. Seidel, How good are convex hull algorithms? 7 (1997) 189-201 1- 14 177-189 187-206 247-256 223-238 1- 25 111-125 247-259 115-122 117-141 237-246 27- 35 139-149 231-252 79-113 307-313 293-302 239-247 235-239 1- 11 241-254 265-301 Baeza-Yates, R. and R. Schott, Parallel searching in the plane 5 (1995) Barequet, G., M. Dickerson and P. Pau, Translating a convex polygon to contain a maximum number of points 8 (1997) Barequet, G., M. Dickerson and D. Eppstein, On triangulating three-dimensional polygons 10 (1998) Beanquier, D., M. Nivat, E. Remila and M. Robson, Tiling figures of the plane with two bars 5 (1995) 143-154 167-179 155-170 1- 25 * For the sake of simplicity and uniformity, all names beginning with articles or prepositions are listed as if written as single words. Elsevier Science B.V.
Transcript
•:• Computational Geometry
Theory and Applications ELSEVIER Computational Geometry 10 (1998) 321-332
Master index of Volumes 1-10
Agarwal, EK. and M. Sharir, Off-line dynamic maintenance of the width of a planar point set 1 (1991) 65- 78 Agarwal, P.K., J. Matou~ek and S. Suri, Farthest neighbors, maximum spanning trees and related
problems in higher dimensions 1 (1991) Agarwal, EK. and J. Matou~ek, Relative neighborhood graphs in three dimensions 2 (1992) Agarwal, EK., On stabbing lines for convex polyhedra in 3D 4 (1994) Agarwal, EK., M.J. Katz and M. Sharir, Computing depth orders for fat objects and related problems 5 (1995) Akutsu, T., On determining the congruence of point sets in d dimensions 9 (1998) Allen, S. and D. Dutta, Wall thickness control in layered manufacturing for surfaces with closed
slices 10 (1998) Alsuwaiyel, M.H. and D.T. Lee, Minimal link visibility paths inside a simple polygon 3 (1993) Alt, H., M. Godau and S. Whitesides, Universal 3-dimensional visibility representations for graphs 9 (1998) Anagnostou, E. and D. Corneil, Polynomial-time instances of the Minimum Weight Triangulation
problem 3 (1993) Andersson, A. and K. Swanson, On the difficulty of range searching 8 (1997) Andrews, M.G. and D.T. Lee, Parallel algorithms on circular-arc graphs 5 (1995) Arkin, E.M., P. Belleville, J.S.B. Mitchell, D. Mount, K. Romanik, S. Salzberg and D. Souvaine,
Testing simple polygons 8 (1997) 97-114 Arkin, E.M., M. Held, J.S.B. Mitchell and S.S. Skiena, Recognizing polygonal parts from width
measurements 9 (1998) Aronov, B., R. Seidel and D. Souvaine, On compatible triangulations of simple polygons 3 (1993) Aronov, B. and M. Sharir, The common exterior of convex polygons in the plane 8 (1997) Asano, T. and N. Katoh, Variants for the Hough transform for line detection 6 (1996) Atallah, M.J. and D.Z. Chen, Parallel rectilinear shortest paths with rectangular obstacles 1 (1991) Atallah, M.J. and D.Z. Chen, On parallel rectilinear obstacle-avoiding paths 3 (1993) Atallah, M.J. and A. Fabri, On the multisearching problem for hypercubes 5 (1995) Attali, D., r-regular shape reconstruction from unorganized points 10 (1998) Avgustinovich, S.V. and S.V. Sevast'janov, Vector summation within minimal angle 2 (1992) Avis, D., E Erd6s and J. Pach, Distinct distances determined by subsets of a point set in space 1 (1991) Avis, D. and V.P. Grishukhin, A bound on the k-gonality of facets of the hypermetric cone and
related complexity problems 2 (1992) Avis, D., D. Bremner and R. Seidel, How good are convex hull algorithms? 7 (1997)
189-201 1- 14
177-189 187-206 247-256
223-238 1- 25
111-125
247-259 115-122 117-141
237-246 27- 35
139-149 231-252
79-113 307-313 293-302 239-247 235-239
1- 11
241-254 265-301
Baeza-Yates, R. and R. Schott, Parallel searching in the plane 5 (1995) Barequet, G., M. Dickerson and P. Pau, Translating a convex polygon to contain a maximum
number of points 8 (1997) Barequet, G., M. Dickerson and D. Eppstein, On triangulating three-dimensional polygons 10 (1998) Beanquier, D., M. Nivat, E. Remila and M. Robson, Tiling figures of the plane with two bars 5 (1995)
143-154
167-179 155-170
1- 25
* For the sake of simplicity and uniformity, all names beginning with articles or prepositions are listed as if written as single words.
Elsevier Science B.V.
322 Master index of Volumes 1-10 / Computational Geometry 10 (1998) 321-332
Berretty, R.-E, K. Goldberg, M.H. Overmars and A.E van der Stappen, Computing fence designs for orienting parts
Belleville, E and T.C. Shermer, Probing polygons minimally is hard Belleville, E, see Arkin, E.M. Biedl, T. and G. Kant, A better heuristic for orthogonal graph drawings Bistiolas, V., D. Sofotassios and A. Tsakalidis, Computing rectangle enclosures Biswas, S., D.C. Prasad and S.E Pal, Recognizing weakly convex visible polygons Boissonnat, J.-D. and K.T.G. Dobrindt, On-line construction of the upper envelope of triangles and
surface patches in three dimensions Boissonnat, J.-D., A. Ctrtzo, O. Devillers, J. Duquesne and M. Yvinec, An algorithm for construct-
ing the convex hull of a set of spheres in dimension d Bokowski, J., J. Richter-Gebert and W. Schindler, On the distribution of order types Bose, E, D. Bremner and G. Toussaint, All convex polyhedra can be clamped with parallel jaw
grippers Bose, E, T. Shermer, G. Toussaint and B. Zhu, Guarding polyhedral terrains Bose, E and L. Devroye, Intersections with random geometric objects Brass, E, Erd6s distance problems in normed spaces Bremner, D., see Bose, E Bremner, D., see Avis, D. Breu, H. and D.G. Kirkpatrick, Unit disk graph recognition is NP-hard Br6nnimann, H. and B. Chazelle, Optimal slope selection via cuttings
Cahill, J.M., see Dey, T.K. Capoyleas, V,, On the area of the intersection of disks in the plane Ctrtzo, A., see Boissonnat, J.-D. Chazelle, B., H. Edelsbrunner, L.J. Guibas, R. Pollack, R. Seidel, M. Sharir and J. Snoeyink,
Counting and cutting cycles of lines and rods in space Chazelle, B. and J. Friedman, Point location among hyperplanes and unidirectional ray-shooting Chazelle, B. and J. Matougek, Derandomizing an output-sensitive convex hull algorithm in three
dimensions Chazelle, B. and B. Rosenberg, Simplex range reporting on a pointer machine Chazelle, B., D.P. Dobkin, N. Shouraboura and A. Tal, Strategies for polyhedral surface decompo-
sition: An experimental study Chazelle, B., see Brtnnimann, H. Chen, D.Z., see Atallah, M.J. Chen, D.Z., see Atallah, M.J. Chew, L.P. and K. Kedem, A convex polygon among polygonal obstacles: placement and high-
clearance motion Chew, L.P., Near-quadratic bounds for the L1 Voronoi diagram of moving points Chew, L.P., M.T. Goodrich, D.P. Huttenlocher, K. Kedem, J.M. Kleinberg and D. Kravets, Geometric
pattern matching under Euclidean motion Chew, L.P. and K. Kedem, Getting around a lower bound for the minimum Hausdorff distance Chiang, Y.-J., Experiments on the practical I/O efficiency of geometric algorithms: Distribution
sweep versus plane sweep Clarkson, K.L., K. Mehlhorn and R. Seidel, Four results on randomized incremental constructions Colley, P., A. Lubiw and J. Spinrad, Visibility graphs of towers Corneil, D., see Anagnostou, E. Corneil, D., see Everett, H. Crescenzi, P., G. Di Battista and A. Piperuo, A note on optimal area algorithms for upward drawings
Master index of Volumes 1-I0 / Computational Geometry 10 (1998) 321-332 323
Crescenzi, P., P. Penna and A. Piperno, Linear area upward drawings of AVL trees Csizmadia, G. and G. T6th, Note on an art gallery problem
9(1998) 25- 42 10(1998) 47- 55
Daniels, K., V. Milenkovic and D. Roth, Finding the largest area axis-parallel rectangle in a polygon Das, G., P.J. Heffernan and G. Narasimhan, LR-visibility in polygons Das, G. and M.T. Goodrich, On the complexity of optimization problems for 3-dimensional convex
polyhedra and decision trees de Berg, M., On rectilinear link distance de Berg, M. and M.H. Overmars, Hidden surface removal for c-oriented polyhedra de Berg, M., Dynamic output-sensitive hidden surface removal for c-oriented polyhedra de Berg, M., Generalized hidden surface removal de Berg, M., Computing half-plane and strip discrepancy of planar point sets de Berg, M., M. van Kreveld, O. Schwarzkopf and J, Snoeyink, Point location in zones of k-flats
in arrangements de Berg, M., M.M. de Groot and M.H. Overmars, Perfect binary space partitions de Berg, M., M. de Groot and M. Overmars, New results on binary space partitions in the plane de Groot, M.M., see de Berg, M. de Groot, M., see de Berg, M. Dehne, E, A. Ferreira and A. Rau-Chaplin, Parallel fractional cascading on hypercube multipro-
cessors Dehne, F., see Hambrusch, S.E. Devillers, O., S. Meiser and M. Teillaud, Fully dynamic Delaunay triangulation in logarithmic
expected time per operation Devillers, O., see Boissonnat, J.-D. Devillers, O., M. Golin, K. Kedem and S. Schirra, Queries on Voronoi diagrams of moving points Devroye, L., see Bose, P. Dey, T.K., On counting triangulations in d dimensions Dey, T.K., M.B. Dillencourt, S.K. Ghosh and J.M. Cahill, Triangulating with high connectivity Dey, T.K. and N.R. Shah, On the number of simplicial complexes in R a Dey, T.K., see Prasad, D.C. Di Battista, G., see Crescenzi, P. Di Battista, G., P. Eades, R. Tamassia and I.G. Tollis, Algorithms for drawing graphs: an annotated
bibliography Di Battista, G., A. Garg, G. Liotta, R. Tamassia, E. Tassinari and F. Vargiu, An experimental
comparison of four graph drawing algorithms Di Battista, G. and R. Tamassia, Geometric Representations of Graphs Dickerson, M., see Barequet, G. Dickerson, M., see Barequet, G. Dickerson, M.T. and D. Eppstein, Algorithms for proximity problems in higher dimensions Dickerson, M.T., R.L.S. Drysdale, S.A. McElfresh and E. Welzl, Fast greedy triangulation algo-
rithms Dillencourt, M.B., see Dey, T.K. Dobkin, D.P., see Chazelle, B. Dobrindt, K.T.G., see Boissonnat, J.-D. Drysdale, R.L.S., see Su, P. Drysdale, R.L.S., see Dickerson, M.T. Duquesne, J., see Boissonnat, J.-D. Dutta, D., see Allen, S.
324 Master index of Volumes 1-10 / Computational Geometry 10 (1998) 321-332
Dwyer, R.A., Maximal and minimal balls Dwyer, R.A., The expected size of the sphere-of-influence graph
Eades, P., see Di Battista, G. Edelsbrunner, H., see Chazelle, B. Edelsbrunner, H. and R. Waupotitsch, A combinatorial approach to cartograms Efrat, A., G. Rote and M. Sharir, On the union of fat wedges and separating a collection of segments
by a line Efrat, A., M. Sharir and A. Ziv, Computing the smallest k-enclosing circle and related problems E[gecio~lu, 13. and T.F. Gonzalez, A computationally intractable problem on simplicial complexes Eppstein, D., The farthest point Delaunay triangulation minimizes angles Eppstein, D., see Dickerson, M.T. Eppstein, D., Average case analysis of dynamic geometric optimization Eppstein, D., Faster geometric k-point MST approximation Eppstein, D., see Barequet, G. Erd6s, E, see Avis, D. Erd6s, P. and E Fishbum, Minimum planar sets with maximum equidistance counts Everett, H. and D. Corneil, Negative results on characterizing visibility graphs Everett, H. and E. Rivera-Campo, Edge guarding polyhedral terrains
Fabri, A., see Atallah, M.J. Fekete, S.E and G.J. Woeginger, Angle-Restricted Tours in the plane Ferreira, A., see Dehne, E Ferrucci, V., see Vleugels, J. Finn, P.W., L.E. Kavraki, J.-C. Latombe, R. Motwani, C. Shelton, S. Venkatasubramanian and
A. Yao, RAPID: Randomized pharmacophore identification for drug design Fischer, E, Sequential and parallel algorithms for finding a maximum convex polygon Fishburn, E, Convex polygons with few intervertex distances Fishbum, E, see Erd6s, E Fishburn, EC. and J.A. Reeds, Unit distances between vertices of a convex polygon Friedman, J., see Chazelle, B. Fuchs, U., see Schwarzkopf, O. Fukuda, K. and V. Rosta, Combinatorial face enumeration in convex polytopes Fukuda, K., T.M. Liebling and E Margot, Analysis of backtrack algorithms for listing all vertices
and all faces of a convex polyhedron
Gajentaan, A. and M.H. Overmars, On a class of O(r~ 2) problems in computational geometry Garg, A., see Di Battista, G. Garg, A., New results on drawing angle graphs Gewali, L.R and S. Ntafos, Covering grids and orthogonal polygons with periscope guards Ghosh, S.K., A. Maheshwari, S.P. Pal, S. Saluja and C.E. Veni Madhavan, Characterizing and
recognizing weak visibility polygons Ghosh, S.K., see Dey, T.K. Ghosh, S.K. and S. Saluja, Optimal on-line algorithms for walking with minimum number of turns
in unknown streets Ghouse, M.R. and M.T. Goodrich, Fast randomized parallel methods for planar convex hull con-
struction Godau, M., see Alt, H. Goldberg, K., see Berretty, R.-P. Goldberg, K.Y., see Rao, A.S. Golin, M., see Devillers, 0.
Master index of Volumes 1-10 / Computational Geometry 10 (1998) 321-332 325
Golin, M.J., How many maxima can there be? Gonzalez, T.F., M. Razzazi, M.-T. Shing and S.-Q. Zheng, On optimal guillotine partitions approx-
imating optimal d-box partitions Gonzalez, T.F., see E~ecio~lu, O. Goodrich, M.T., Constructing the convex hull of a partially sorted set of points Goodrich, M.T., see Chew, L.E Goodrich, M.T., see Ghouse, M.R. Goodrich, M.T., see Das, G. Gravesen, J., Adaptive subdivision and the length and energy of Brzier curves Grishukhin, V.E, see Avis, D. Guha, S., An optimal parallel algorithm using exclusive read/writes for the rectilinear Voronoi
diagram Guibas, L.J., see Chazelle, B. Guibas, L.J., M.H. Overmars and J.-M. Robert, The exact fitting problem in higher dimensions Gupta, E, R. Janardan and M. Smid, Algorithms for generalized halfspace range searching and
other intersection searching problems Gupta, P., R. Janardan and M. Staid, Algorithms for generalized halfspace range searching and
other intersection searching problems Gupta, E, R. Janardan and M. Staid, Fast algorithms for collision and proximity problems involving
moving geometric objects Gupta, N. and S. Sen, Optimal, output-sensitive algorithms for constructing planar hulls in parallel Gyrri, E., F. Hoffmann, K. Kriegel and T. Shermer, Generalized guarding and partitioning for
rectilinear polygons
Hagauer, J. and G. Rote, Three-clustering of points in the plane Halperin, D. and M. Sharir, Improved combinatorial bounds and efficient techniques for certain
motion planning problems with three degrees of freedom Halperin, D., see van der Stappen, A.F. Halperin, D. and C.-K. Yap, Combinatorial complexity of translating a box in polyhedral 3-space Halperin, D. and C.R. Shelton, A perturbation scheme for spherical arrangements with application
to molecular modeling Hambrusch, S. and H.-Y. Tu, A framework for 1-D compaction with forbidden region avoidance Hambrusch, S.E. and E Dehne, Determining maximum k-width-connectivity on meshes Har-Peled, S., An output sensitive algorithm for discrete convex hulls Heath, D. and S. Kasif, The complexity of finding minimal Voronoi covers with applications to
machine learning Heath, L.S., EK. Paripati and J.W. Roach, Representing polyhedra: faces are better than vertices Heffernan, EJ., Linear-time algorithms for weakly-monotone polygons Heffernan, EJ. and S. Schirra, Approximate decision algorithms tbr point set congruence Heffernan, EJ., see Das, G. Held, M., see Arkin, E.M. Hershberger, J., Upper envelope onion peeling Hershberger, J., Minimizing the sum of diameters efficiently Hershberger, J. and J. Snoeyink, Computing minimum length paths of a given homotopy class Hershberger, J. and S. Suri, Finding a shortest diagonal of a simple polygon in linear time Hershberger, J. and S. Suri, Practical methods for approximating shortest paths on a convex polytope
in I1~ 3 Hershberger, J.E. and J.S. Snoeyink, Erased arrangements of lines and convex decompositions of
polyhedra Hirata, T., J. Matou~ek, X.-H. Tan and T. Tokuyama, Complexity of projected images of convex
326 Master index of Volumes 1-10 / Computational Geometry 10 (1998) 321-332
Hoffman, CM., Foreword Hoffmann, E, see Gyrri, E. Hohmeyer, M.E. and S.J. Teller, Stabbing isothetic boxes and rectangles in O(n log n) time Hurtado, E and M. Noy, Triangulations, visibility graph and reflex vertices of a simple polygon Huttenlocher, D.P., see Chew, L.P.
Janardan, R., see Gupta, P. Janardan, R., see Gupta, E Janardan, R., see Gupta, E Jansen, K., One strike against the rain-max degree triangulation problem Jaromczyk, J.W. and G.W. Wasilkowski, Computing convex hull in a floating point arithmetic Joseph, E. and S.S. Skiena, Model-based probing strategies for convex polygons
Kalyanasundaram, B. and K. Pruhs, A competitive analysis of algorithms for searching unknown scenes
Kant, G., see Biedl, T. Kasif, S., see Heath, D. Katoh, N., see Asano, T. Katz, M.J., M.H. Overmars and M. Sharir, Efficient hidden surface removal for objects with small
union size Katz, M.J., see Agarwal, P.K. Katz, M.J., 3-D vertical ray shooting and 2-D point enclosure, range searching, and arc shooting
amidst convex fat objects Kavraki, L.E., see Finn, P.W. Kedem, K., see Chew, L.P. Kedem, K., see Devillers, O. Kedem, K., see Chew, L.E Kedem, K., see Chew, L.P. Kirkpatrick, D.G. and S.K. Wismath, Determining bar-representability for ordered weighted graphs Kirkpatrick, D.G., see Breu, H. Kitsios, N. and A. Tsakalidis, Space reduction and an extension for a hidden line elimination
algorithm Klein, R., Walking an unknown street with bounded detour Klein, R., K. Mehlhorn and S. Meiser, Randomized incremental construction of abstract Voronoi
diagrams Kleinberg, J.M., see Chew, L.P. Kranakis, E. and M. Pocchiola, Counting problems relating to a theorem of Dirichlet Kravets, D., see Chew, L.P. Kriegel, K., see Gyrri, E.
Latombe, J.-C., see Finn, EW. L~, N.-M., Randomized incremental construction of simple abstract Voronoi diagrams in 3-space Lee, D.T., see Alsuwaiyel, M.H. Lee, D.T., see Andrews, M.G. Lee, D.T., see Swanson, K. Liebling, T.M., see Fukuda, K. Lingas, A., A linear-time construction of the relative neighborhood graph from the Delaunay tri-
angulation Liotta, G., see Di Battista, G. Liotta, G., A. Lubiw, H. Meijer and S.H. Whitesides, The rectangle of influence drawability problem Lubiw, A. and J. Urrutia, Foreword
10(1998) 6(1996) 2(1992) 6(1996) 7(1997)
5 (1995) 6(1996) 6(1996) 3(1993) 4(1994) 2(1992)
3(1993) 9(1998) 3(1993) 6(1996)
2(1992) 5(1995)
8(1997) 10(1998) 3(1993) 6(1996) 7(1997)
10(1998) 6(1996) 9(1998)
6 (1996) 1 (1991)
3 (1993) 7 (1997) 4 (1994) 7 (1997) 6 (1996)
10(1998) 8(1997) 3(1993) 5 (1995) 5(1995) 8(1997)
4(1994) 7(1997)
10(1998) 7(1997)
221 21- 44
201-207 355-369 113-124
321-340 l - 19
371-391 107-120 283-292 209-221
139-155 159-180 289-305 231-252
223-234 187-206
299-316 263-272
59- 89 315-327 113-124 197-202 99-122
3 - 24
397-404 325-351
157-184 113-124 309-325 113-124 21- 44
263-272 279-298
l - 25 117-141 225-235
l - 12
199-208 303-325
1- 22 1- 2
Master index of Volumes 1-I0 / Computational Geometry 10 (1998) 321-332 327
Lubiw, A., see Colley, R Lubiw, A., see Liotta, G.
Maheshwari, A., see Ghosh, S.K. Margot, E, see Fukuda, K. Mark Keil, J., Computing a subgraph of the minimum weight triangulation Matou~ek, J., see Agarwal, P.K. Matougek, J., see Agarwal, P.K. Matougek, J., Reporting points in halfspaces Matou~ek, J., On vertical ray shooting in arrangements Matou~ek, J., see Hirata, T. Matou~ek, J., see Chazelle, B. Matougek, J. and O. Schwarzkopf, A deterministic algorithm for the three-dimensional diameter
problem Mazrn, M. and T. Recio, Voronoi Diagrams on orbifolds McElfresh, S.A., see Dickerson, M.T. Mehlhorn, K., see Klein, R. Mehlhorn, K., see Clarkson, K.L. Mehlhorn, K., M. Sharir and E. Welzl, Tail estimates for the efficiency of randomized incremental
algorithms for line segment intersection Mehlhorn, K., M. Mailer, S. Naher, S. Schirra, M. Seel, C. Uhrig and J. Ziegler, A computational
basis for higher-dimensional computational geometry and applications Meijer, H., see Liotta, G. Meiser, S., see Devillers, O. Meiser, S., see Klein, R. Metaxas, P.T., G.E. Pantziou and A. Symvonis, A note on parallel algorithms for optimal h-v
drawings of binary trees Milenkovic, V., see Milenkovic, V.J. Milenkovic, V., see Daniels, K. Milenkovic, V.J. and V. Milenkovic, Rational orthogonal approximations to orthogonal matrices Milenkovic, V.J., Rotational polygon overlap minimization and compaction Mirzaian, A., Hamiltonian triangulations and circumscribing polygons of disjoint line segments Mitchell, J.S.B. and S. Suri, Separation and approximation of polyhedral objects Mitchell, J.S.B., see Zhu, C. Mitchell, J.S.B., see Arkin, E.M. Mitchell, J.S.B., see Arkin, E.M. Mitchell, S.A., Approximating the maxmin-angle covering triangulation Mount, D., see Arkin, E.M. Motwani, R., see Finn, P.W. Mtiller, M., see Mehlhorn, K.
N~iher, S., see Mehlhorn, K. Naiman, D.Q. and H.P. Wynn, On intersecting a point set with Euclidean balls Nakano, S.-i., see Rahman, Md.S. Narasimhan, G., see Das, G. Nilsson, B.J. and S. Schuierer, An optimal algorithm for the rectilinear link center of a rectilinear
polygon Nishizeki, T., see Rahman, Md.S. Nivat, M., see Beauquier, D. Noy, M., see Hurtado, E Ntafos, S., Watchman routes under limited visibility Ntafos, S., see Gewali, L.E
328 Master index of Volumes 1-10 / Computational Geometry 10 (1998) 321-332
O'Rourke, J. and J. Rippel, Two segment classes with Hamiltonian visibility graphs O'Rourke, J. and I. Streinu, The vertex-edge visibility graph of a polygon Overmars, M., see Vleugels, J. Overmars, M., see de Berg, M. Overmars, M.H. and M. Sharir, Merging visibility maps Overmars, M.H., see de Berg, M. Overmars, M.H., see Katz, M.J. Overmars, M.H., see van der Stappen, A.E Overmars, M.H., see Gajentaan, A. Overmars, M.H., see Guibas, L.J. Overmars, M.H., see de Berg, M. Overmars, M.H., see Berretty, R.-E
Pach, J., see Avis, D. Pach, J., A Tverberg-type result on multicolored simplices Pach, J. and E. Rivera-Campo, On circumscribing polygons for line segments Pal, S.E, see Ghosh, S.K. Pal, S.E, see Biswas, S. Pal, S.E, see Prasad, D.C. Palios, L., Optimal tetrahedralization of the 3D-region "between" a convex polyhedron and a convex
polygon Pantziou, G.E., see Metaxas, P.T. Papakostas, A. and I.G. Tollis, Algorithms for area-efficient orthogonal drawings Paripati, EK., see Heath, L.S. Pan, P., see Barequet, G. Pellegrini, M., Lower bounds on stabbing lines in 3-space Penna, E, see Crescenzi, P. Piperno, A., see Crescenzi, E Piperno, A., see Crescenzi, P. Pocchiola, M., see Kranakis, E. Pocchiola, M. and G. Vegter, Minimal tangent visibility graphs Pollack, R., see Chazelle, B. Prasad, D.C., see Biswas, S. Prasad, D.C., S.E Pal and T.K. Dey, Visibility with multiple diffuse reflections Pruhs, K., see Kalyanasundaram, B.
Rahman, Md.S., S.-i. Nakano and T. Nishizeki, Rectangular grid drawings of plane graphs Ramaswami, S., P. Ramos and G. Toussaint, Converting triangulations to quadrangulations Ramos, E.A., Intersection of unit-balls and diameter of a point set in R 3 Ramos, E, see Ramaswami, S. Rao, A., see Vleugels, J. Rao, A.S. and K.Y. Goldberg, Computing grasp functions Rappaport, D., A convex hull algorithm for discs, and applications Rappaport, D. and A. Rosenbloom, Moldable and castable polygons Ran-Chaplin, A., see Dehne, E Razzazi, M., see Gonzalez, T.E Recio, T., see Maz6n, M. Reeds, J.A., see Fishburn, EC. Remila, E., see Beauquier, D. Richter-Gebert, J., see Bokowski, J. Rippel, J., see O'Rourke, J.
Master index of Volumes 1-10 / Computational Geometry 10 (1998) 321-332 329
Rivera-Campo, E., see Everett, H. Rivera-Campo, E., see Pach, J. Roach, J.W., see Heath, L.S. Robert, J.-M. and G.T. Toussaint, Linear approximation of simple objects Robert, J.-M., see Guibas, L.J. Robert, J.-M., Geometric orderings of intersecting translates and their applications Robson, M., see Beauquier, D. Romanik, K. and C. Smith, Testing geometric objects Romanik, K. and S. Salzberg, Testing orthogonal shapes Romanik, K., see Arkin, EM. Rosenberg, B., see Chazelle, B. Rosenbloom, A., see Rappaport, D. Rosta, V., see Fukuda, K. Rote, G., see Efrat, A. Rote, G., see Hagauer, J. Rote, G., see Schwarzkopf, O. Roth, D., see Daniels, K.
Sack, J.-R. and J. Urrutia, Editorial Sack, J.-R. and J. Urrutia, Obituary Paul Erdrs (1913-1996) Sack, J.-R. and J. Urrutia, Editorial Saluja, S., see Ghosh, S.K. Saluja, S., see Ghosh, S.K. Salzberg, S., see Romanik, K. Salzberg, S., see Arkin, E.M. Sauer, P., On the recognition of digital circles in linear time Schindler, W., see Bokowski, J. Schindler, W., Equivariant mappings: a new approach in stochastic simulations Schirra, S., see Heffernan, P.J. Schirra, S., see Devillers, O. Schirra, S., see Mehlhorn, K. Schott, R., see Baeza-Yates, R. Schuierer, S., see Nilsson, B.J. Schwarzkopf, O., see de Berg, M. Schwarzkopf, O., see Matougek, J. Schwarzkopf, O., U. Fuchs, G. Rote and E. Welzl, Approximation of convex figures by pairs of
rectangles Seel, M., see Mehlhorn, K. Seidel, R., A simple and fast incremental randomized algorithm for computing trapezoidal decom-
positions and for triangulating polygons Seidel, R., see Chazelle, B. Seidel, R., see Aronov, B. Seidel, R., see Clarkson, K.L. Seidel, R., The upper bound theorem for polytopes: an easy proof of its asymptotic version Seidel, R., see Avis, D. Sen, S., see Gupta, N. Sevast'janov, S.V., see Avgustinovich, S.V. Shah, N.R., see Dey, T.K. Sharir, M., see Overmars, M.H. Sharir, M., see Agarwal, EK. Sharir, M., see Halperin, D.
330 Master index of Volumes 1-10 / Computational Geometry 10 (1998) 321-332
Sharir. M., see Chazelle, B. Sharir. M., see Katz, M.J. Sharir. M., see Mehlhorn, K. Shafir. M., see Efrat, A. Sharir. M. and S. Toledo, Extremal polygon containment problems Sharir. M., see Efrat, A. Sharir. M., see Agarwal, P.K. Sharir. M., see Aronov, B. Shelton, C., see Finn, P.W. Shelton, C.R., see Halperin, D. Shermer, T., Computing bushy and thin triangulations Shermer, T., see Gy~ri, E. Shermer, T., see Bose, E Shermer, T.C., see Bellevitle, E Shing, M.-T., see Gonzalez, T.E Shor, P.W. and C.J. Van Wyk, Detecting and decomposing self-overlapping curves Shouraboura, N., see Chazelle, B. Skiena, S.S., see Joseph, E. Skiena, S.S., see Arkin, E.M. Smid, M., see Gupta, E Smid, M., see Gupta, E Smid, M., see Gupta, E Smith, C., see Romanik, K. Snoeyink, J., see Chazelle, B. Snoeyink, J., see Hershberger, J. Snoeyink, J., see de Berg, M. Snoeyink, J., see Zhu, C. Snoeyink, J.S., see Hershberger, J.E. Sofotassios, D., see Bistiolas, V. Souvaine, D., see Aronov, B. Souvaine, D., see Arkin, E.M. Souvaine, D.L. and C.-K. Yap, Combinatorial complexity of signed discs Spinrad, J., see Colley, E Steiger, W. and I. Streinu, Illumination by floodlights Stifter, S., Characterization of contour elements that generate abstract Voronoi diagrams Streinu, I., see Steiger, W. Streinu, I., see O'Rourke, J. Su, R and R.L.S. Drysdale, A comparison of sequential Delaunay triangulation algorithms Sundaram, G., see Zhu, C. Suri, S., see Agarwal, EK. Suri, S., see Mitchell, J.S.B. Suri, S., see Hershberger, J. Suri, S., see Hershberger, J. Swanson, K., D.T. Lee and V.L. Wu, An optimal algorithm for roundness determination on convex
polygons Swanson, K., see Andersson, A. Symvonis, A., see Metaxas, P.T.
Tal, A., see Chazelle, B. Tamassia, R., see Di Battista, G. Tamassia, R., see Di Battista, G.
Master index of Volumes 1-10/Computational Geometry I0 (1998) 321-332 331
Tamassia, R., see Di Battista, G. Tan, X.-H., see Hirata, T. Tassinari, E., see Di Battista, G. Teillaud, M., see Devillers, O. Teller, S.J., see Hohmeyer, M.E. Teng, S.-H., Combinatorial aspects of geometric graphs Tokuyama, T., see Hirata, T. Toledo, S., see Sharir, M. Tollis, I.G., see Di Battista, G. Tollis, I.G., see Papakostas, A. T6th, G., The shortest distance among points in general position T6th, G., see Csizmadia, G. Toussaint, G., see Bose, P. Toussaint, G., see Bose, P. Toussaint, G., see Ramaswami, S. Toussaint, G.T., see Robert, J.-M. Tsakalidis, A., see Bistiolas, V. Tsakalidis, A., see Kitsios, N. Tsin, Y.H., see Wang, C.A. Tu, H.-Y., see Hambrusch, S.
Uhrig, C., see Mehlhorn, K. Urabe, M. and M. Watanabe, On a counterexample to a conjecture of Mirzaian (Note) Urrutia, J., see Sack, J.-R. Urrutia, J., see Lubiw, A. Urrutia, J., see Sack, J.-R. Urrutia, J., see Sack, J.-R.
van der Stappen, A.F., D. Halperin and M.H. Overrnars, The complexity of the free space for a robot moving amidst fat obstacles
van der Stappen, A.E, see Berretty, R.-E Van Kreveld, M., see de Berg, M. van Kreveld, M., On fat partitioning, fat covering and the union size of polygons Van Wyk, C.J., see Shor, EW. Vargiu, E, see Di Battista, G. Vegter, G., see Pocchiola, M. Veltkamp, R.C., The -),-neighborhood graph Veni Madhavan, C.E., see Ghosh, S.K. Venkatasubramanian, S., see Finn, P.W. Vleugels, J., V. Ferrucci, M. Overmars and A. Rao, Hunting Voronoi vertices
Wagner, E and A. Wolff, A practical map labeling algorithm Wang, C.A. and Y.H. Tsin, Finding constrained and weighted Voronoi diagrams in the plane Wasilkowski, G.W., see Jaromczyk, J.W. Watanabe, M., see Urabe, M. Waupotitsch, R., see Edelsbrunner, H. Welzl, E., see Mehlhorn, K. Welzl, E., Foreword Welzl, E., see Dickerson, M.T. Welzl, E., see Schwarzkopf, O. Whitesides, S., see Alt, H.
332 Master index of Volumes 1-10 / Computational Geometry 10 (1998) 321-332
Whitesides, S.H., see Liotta, G. Wismath, S.K., see Kirkpatrick, D.G. Woeginger, G.J., see Fekete, S.E Wolff, A., see Wagner, E Wu, V.L., see Swanson, K. Wynn, H.P., see Naiman, D.Q.
10(1998) 6(1996) 8(1997) 7(1997) 5(1995) 7(1997)
1- 22 99-122
195-218 387-404 225-235 237-244
Yao, A., see Finn, EW. Yap, C.-K., see Souvaine, D.L. Yap, C.-K., Towards exact geometric computation Yap, C.-K., see Halperin, D. Yvinec, M., see Boissonnat, J.-D.
10(1998) 5 (1995) 7 (1997) 9 (1998) 6 (1996)
263-272 207-223
3 - 23 181-196 123-130
Zheng, S.-Q., see Gonzalez, T.E Zhu, B., see Bose, P. Zhu, B., Computing the shortest watchtower of a polyhedral terrain in O(n log 7z) time Zhu, C., G. Sundaram, J. Snoeyink and J.S.B. Mitchell, Generating random polygons with given
vertices Ziegler, J., see Mehlhorn, K. Ziv, A., see Efrat, A.
