Journals in DBLP
Komei Fukuda , Thomas M. Liebling , François Margot Analysis of Backtrack Algorithms for Listing All Vertices and All Faces of a Convex Polyhedron. [Citation Graph (0, 0)][DBLP ] Comput. Geom., 1997, v:8, n:, pp:1-12 [Journal ] Jens Gravesen Adaptive Subdivision and the Length and Energy of Bézier Curves. [Citation Graph (0, 0)][DBLP ] Comput. Geom., 1997, v:8, n:, pp:13-31 [Journal ] Géza Tóth The Shortest Distance Among Points in General Position. [Citation Graph (0, 0)][DBLP ] Comput. Geom., 1997, v:8, n:, pp:33-38 [Journal ] Tamal K. Dey , Michael B. Dillencourt , Subir Kumar Ghosh , Jason M. Cahill Triangulating with High Connectivity. [Citation Graph (0, 0)][DBLP ] Comput. Geom., 1997, v:8, n:, pp:39-56 [Journal ] Edgar A. Ramos Intersection of Unit-balls and Diameter of a Point Set in 3. [Citation Graph (0, 0)][DBLP ] Comput. Geom., 1997, v:8, n:, pp:57-65 [Journal ] Matthew Dickerson , Robert L. (Scot) Drysdale III , Scott A. McElfresh , Emo Welzl Fast Greedy Triangulation Algorithms. [Citation Graph (0, 0)][DBLP ] Comput. Geom., 1997, v:8, n:, pp:67-86 [Journal ] Johann Hagauer , Günter Rote Three-clustering of Points in the Plane. [Citation Graph (0, 0)][DBLP ] Comput. Geom., 1997, v:8, n:, pp:87-95 [Journal ] Esther M. Arkin , Patrice Belleville , Joseph S. B. Mitchell , David M. Mount , Kathleen Romanik , Steven Salzberg , Diane L. Souvaine Testing Simple Polygons. [Citation Graph (0, 0)][DBLP ] Comput. Geom., 1997, v:8, n:, pp:97-114 [Journal ] Arne Andersson , Kurt Swanson On the Difficulty of Range Searching. [Citation Graph (0, 0)][DBLP ] Comput. Geom., 1997, v:8, n:, pp:115-122 [Journal ] Gautam Das , Michael T. Goodrich On the Complexity of Optimization Problems for 3-dimensional Convex Polyhedra and Decision Trees. [Citation Graph (0, 0)][DBLP ] Comput. Geom., 1997, v:8, n:, pp:123-137 [Journal ] Boris Aronov , Micha Sharir The Common Exterior of Convex Polygons in the Plane. [Citation Graph (0, 0)][DBLP ] Comput. Geom., 1997, v:8, n:, pp:139-149 [Journal ] Neelima Gupta , Sandeep Sen Optimal, Output-sensitive Algorithms for Constructing Planar Hulls in Parallel. [Citation Graph (0, 0)][DBLP ] Comput. Geom., 1997, v:8, n:, pp:151-166 [Journal ] Gill Barequet , Matthew T. Dickerson , Petru Pau Translating a Convex Polygon to Contain a Maximum Number of Points. [Citation Graph (0, 0)][DBLP ] Comput. Geom., 1997, v:8, n:, pp:167-179 [Journal ] Binhai Zhu Computing the Shortest Watchtower of a Polyhedral Terrain in O(n Log N) Time. [Citation Graph (0, 0)][DBLP ] Comput. Geom., 1997, v:8, n:, pp:181-193 [Journal ] Sándor P. Fekete , Gerhard J. Woeginger Angle-Restricted Tours in the Plane. [Citation Graph (0, 0)][DBLP ] Comput. Geom., 1997, v:8, n:, pp:195-218 [Journal ] M. L. Mazón , Tomás Recio Voronoi Diagrams on Orbifolds. [Citation Graph (0, 0)][DBLP ] Comput. Geom., 1997, v:8, n:, pp:219-230 [Journal ] David Eppstein Faster Geometric K-point MST Approximation. [Citation Graph (0, 0)][DBLP ] Comput. Geom., 1997, v:8, n:, pp:231-240 [Journal ] Subir Kumar Ghosh , Sanjeev Saluja Optimal On-line Algorithms for Walking with Minimum Number of Turns in Unknown Streets. [Citation Graph (0, 0)][DBLP ] Comput. Geom., 1997, v:8, n:, pp:241-266 [Journal ] Tamal K. Dey , Nimish R. Shah On the Number of Simplicial Complexes in D. [Citation Graph (0, 0)][DBLP ] Comput. Geom., 1997, v:8, n:, pp:267-277 [Journal ] Ngoc-Minh Lê Randomized Incremental Construction of Simple Abstract Voronoi Diagrams in 3-space. [Citation Graph (0, 0)][DBLP ] Comput. Geom., 1997, v:8, n:, pp:279-298 [Journal ] Matthew J. Katz 3-D Vertical Ray Shooting and 2-D Point Enclosure, Range Searching, and Arc Shooting Amidst Convex Fat Objects. [Citation Graph (0, 0)][DBLP ] Comput. Geom., 1997, v:8, n:, pp:299-316 [Journal ] Mark de Berg , Marko de Groot , Mark H. Overmars New Results on Binary Space Partitions in the Plane. [Citation Graph (0, 0)][DBLP ] Comput. Geom., 1997, v:8, n:, pp:317-333 [Journal ]