Abstract is missing.
- Mesh generation for domains with small anglesJonathan Richard Shewchuk. 1-10 [doi]
- Triangulations in CGAL (extended abstract)Jean-Daniel Boissonnat, Olivier Devillers, Monique Teillaud, Mariette Yvinec. 11-18 [doi]
- Improving the surface cycle structure for hexahedral mesh generationMatthias Müller-Hannemann. 19-28 [doi]
- Computing integer points in Minkowski sumsIoannis Z. Emiris. 29-36 [doi]
- Point sets with many ::::k::::-setsGéza Tóth. 37-42 [doi]
- An improved bound for ::::k::::-sets in three dimensionsMicha Sharir, Shakhar Smorodinsky, Gábor Tardos. 43-49 [doi]
- Origin-embracing distributions or a continuous analogue of the upper bound theoremUli Wagner, Emo Welzl. 50-56 [doi]
- A Helly-type theorem for hyperplane transversals to well-separated convex setsBoris Aronov, Jacob E. Goodman, Richard Pollack, Rephael Wenger. 57-63 [doi]
- A trace bound for the hereditary discrepancyBernard Chazelle, Alexey Lvov. 64-69 [doi]
- On the continuous Weber and ::::k::::-median problems (extended abstract)Sándor P. Fekete, Joseph S. B. Mitchell, Karin Weinbrecht. 70-79 [doi]
- The 2-center problem with obstaclesDan Halperin, Micha Sharir, Kenneth Y. Goldberg. 80-90 [doi]
- Random sampling in geometric optimization: new insights and applicationsBernd Gärtner, Emo Welzl. 91-99 [doi]
- The analysis of a simple ::::k::::-means clustering algorithmTapas Kanungo, David M. Mount, Nathan S. Netanyahu, Christine D. Piatko, Ruth Silverman, Angela Y. Wu. 100-109 [doi]
- An efficient, exact, and generic quadratic programming solver for geometric optimizationBernd Gärtner, Sven Schönherr. 110-118 [doi]
- Accurate and efficient unions of ballsNina Amenta, Ravi Krishna Kolluri. 119-128 [doi]
- Fast software for box intersectionsAfra Zomorodian, Herbert Edelsbrunner. 129-138 [doi]
- Algebraic methods and arithmetic filtering for exact predicates on circle arcsOlivier Devillers, Alexandra Fronville, Bernard Mourrain, Monique Teillaud. 139-147 [doi]
- Pitfalls in computing with pseudorandom determinantsBernd Gärtner. 148-155 [doi]
- Look - a Lazy Object-Oriented Kernel for geometric computationStefan Funke, Kurt Mehlhorn. 156-165 [doi]
- When crossings count - approximating the minimum spanning treeSariel Har-Peled, Piotr Indyk. 166-175 [doi]
- Linear programming queries revisitedEdgar A. Ramos. 176-181 [doi]
- Point set labeling with specified positionsSrinivas Doddi, Madhav V. Marathe, Bernard M. E. Moret. 182-190 [doi]
- I/O-efficient dynamic planar point location (extended abstract)Lars Arge, Jan Vahrenhold. 191-200 [doi]
- Linear-time triangulation of a simple polygon made easier via randomizationNancy M. Amato, Michael T. Goodrich, Edgar A. Ramos. 201-212 [doi]
- A simple algorithm for homeomorphic surface reconstructionNina Amenta, Sunghee Choi, Tamal K. Dey, N. Leekha. 213-222 [doi]
- Smooth surface reconstruction via natural neighbour interpolation of distance functionsJean-Daniel Boissonnat, Frédéric Cazals. 223-232 [doi]
- Reconstruction curves with sharp cornersTamal K. Dey, Rephael Wenger. 233-241 [doi]
- Voronoi-based interpolation with higher continuityHisamoto Hiyoshi, Kokichi Sugihara. 242-250 [doi]
- Reachability by paths of bounded curvature in convex polygonsHee-Kap Ahn, Otfried Cheong, Jirí Matousek, Antoine Vigneron. 251-259 [doi]
- An algorithm for searching a polygonal region with a flashlightSteven M. LaValle, Borislav H. Simov, Giora Slutzki. 260-269 [doi]
- Computing approximate shortest paths on convex polytopesPankaj K. Agarwal, Sariel Har-Peled, Meetesh Karia. 270-279 [doi]
- Densest tanslational lattice packing of non-convex polygons (extended abstract)Victor Milenkovic. 280-289 [doi]
- Deterministic algorithms for 3-D diameter and some 2-D lower envelopesEdgar A. Ramos. 290-299 [doi]
- Approximating the diameter, width, smallest enclosing cylinder, and minimum-width annulusTimothy M. Chan. 300-309 [doi]
- Testing the congruence of d-dimensional point setsPeter Braß, Christian Knauer. 310-314 [doi]
- Multivariate regression depthMarshall W. Bern, David Eppstein. 315-321 [doi]
- Kinetic collision detection for simple polygonsDavid G. Kirkpatrick, Jack Snoeyink, Bettina Speckmann. 322-330 [doi]
- Kinetic connectivity for unit disksLeonidas J. Guibas, John Hershberger, Subhash Suri, Li Zhang. 331-340 [doi]
- Delaunay triangulations and Voronoi diagrams for Riemannian manifoldsGreg Leibon, David Letscher. 341-349 [doi]
- Sweep algorithms for constructing higher-dimensional constrained Delaunay triangulationsJonathan Richard Shewchuk. 350-359 [doi]
- Cutting glassJános Pach, Gábor Tardos. 360-369 [doi]
- Viro s method disproves Ragsdale s conjecture: a storyJesús A. De Loera, Frederick J. Wicklin. 371-372 [doi]
- Optimal robot localization in treesRudolf Fleischer, Gerhard Trippen. 373-374 [doi]
- Fast computation of generalized Voronoi diagrams using graphics hardwareKenneth E. Hoff III, Tim Culver, John Keyser, Ming C. Lin, Dinesh Manocha. 375-376 [doi]