


default search action
Computational Geometry, Volume 8
Volume 8, 1997
- Komei Fukuda, Thomas M. Liebling, François Margot:

Analysis of Backtrack Algorithms for Listing All Vertices and All Faces of a Convex Polyhedron. 1-12 - Jens Gravesen

:
Adaptive Subdivision and the Length and Energy of Bézier Curves. 13-31 - Géza Tóth:

The Shortest Distance Among Points in General Position. 33-38 - Tamal K. Dey, Michael B. Dillencourt, Subir Kumar Ghosh, Jason M. Cahill:

Triangulating with High Connectivity. 39-56 - Edgar A. Ramos:

Intersection of Unit-balls and Diameter of a Point Set in 3. 57-65 - Matthew Dickerson, Robert L. (Scot) Drysdale III, Scott A. McElfresh, Emo Welzl:

Fast Greedy Triangulation Algorithms. 67-86 - Johann Hagauer, Günter Rote:

Three-clustering of Points in the Plane. 87-95 - Esther M. Arkin, Patrice Belleville, Joseph S. B. Mitchell, David M. Mount, Kathleen Romanik, Steven Salzberg

, Diane L. Souvaine:
Testing Simple Polygons. 97-114 - Arne Andersson, Kurt Swanson:

On the Difficulty of Range Searching. 115-122 - Gautam Das

, Michael T. Goodrich
:
On the Complexity of Optimization Problems for 3-dimensional Convex Polyhedra and Decision Trees. 123-137 - Boris Aronov

, Micha Sharir:
The Common Exterior of Convex Polygons in the Plane. 139-149 - Neelima Gupta, Sandeep Sen:

Optimal, Output-sensitive Algorithms for Constructing Planar Hulls in Parallel. 151-166 - Gill Barequet, Matthew T. Dickerson, Petru Pau:

Translating a Convex Polygon to Contain a Maximum Number of Points. 167-179 - Binhai Zhu:

Computing the Shortest Watchtower of a Polyhedral Terrain in O(n Log N) Time. 181-193 - Sándor P. Fekete, Gerhard J. Woeginger:

Angle-Restricted Tours in the Plane. 195-218 - Marisa Mazón, Tomás Recio

:
Voronoi Diagrams on Orbifolds. 219-230 - David Eppstein:

Faster Geometric K-point MST Approximation. 231-240 - Subir Kumar Ghosh, Sanjeev Saluja:

Optimal On-line Algorithms for Walking with Minimum Number of Turns in Unknown Streets. 241-266 - Tamal K. Dey, Nimish R. Shah:

On the Number of Simplicial Complexes in D. 267-277 - Ngoc-Minh Lê:

Randomized Incremental Construction of Simple Abstract Voronoi Diagrams in 3-space. 279-298 - Matthew J. Katz:

3-D Vertical Ray Shooting and 2-D Point Enclosure, Range Searching, and Arc Shooting Amidst Convex Fat Objects. 299-316 - Mark de Berg, Marko de Groot, Mark H. Overmars:

New Results on Binary Space Partitions in the Plane. 317-333

manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.


Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID














