Conferences in DBLP
Mark de Berg Generalized Hidden Surface Removal. [Citation Graph (0, 0)][DBLP ] Symposium on Computational Geometry, 1993, pp:1-10 [Conf ] Dan Halperin , Micha Sharir New Bounds for Lower Envelopes in Three Dimensions, with Applications to Visibility in Terrains. [Citation Graph (0, 0)][DBLP ] Symposium on Computational Geometry, 1993, pp:11-18 [Conf ] Marco Pellegrini On Lines Missing Polyhedral Sets in 3-Space. [Citation Graph (0, 0)][DBLP ] Symposium on Computational Geometry, 1993, pp:19-28 [Conf ] Dan Halperin , Chee-Keng Yap Combinatorial Complexity of Translating a Box in Polyhedral 3-Space. [Citation Graph (0, 0)][DBLP ] Symposium on Computational Geometry, 1993, pp:29-37 [Conf ] Hazel Everett , Jean-Marc Robert , Marc J. van Kreveld An Optimal Algorithm for the (<= k)-Levels, with Applications to Separation and Transversal Problems. [Citation Graph (0, 0)][DBLP ] Symposium on Computational Geometry, 1993, pp:38-46 [Conf ] David P. Dobkin , David Eppstein Computing the Discrepancy. [Citation Graph (1, 0)][DBLP ] Symposium on Computational Geometry, 1993, pp:47-52 [Conf ] Gautam Das , Paul J. Heffernan , Giri Narasimhan Optimally Sparse Spanners in 3-Dimensional Euclidean Space. [Citation Graph (0, 0)][DBLP ] Symposium on Computational Geometry, 1993, pp:53-62 [Conf ] Nina Amenta Helly Theorems and Generalized Linear Programming. [Citation Graph (0, 0)][DBLP ] Symposium on Computational Geometry, 1993, pp:63-72 [Conf ] Michael T. Goodrich Geometric Partitioning Made Easier, Even in Parallel. [Citation Graph (0, 0)][DBLP ] Symposium on Computational Geometry, 1993, pp:73-82 [Conf ] Shreesh Jadhav , Asish Mukhopadhyay Computing a Centerpoint of a Finite Planar Set of Points in Linear Time. [Citation Graph (0, 0)][DBLP ] Symposium on Computational Geometry, 1993, pp:83-90 [Conf ] Kenneth L. Clarkson , David Eppstein , Gary L. Miller , Carl Sturtivant , Shang-Hua Teng Approximating Center Points with Iterated Radon Points. [Citation Graph (0, 0)][DBLP ] Symposium on Computational Geometry, 1993, pp:91-98 [Conf ] David Eppstein , Gary L. Miller , Shang-Hua Teng A Deterministic Linear Time Algorithm for Geometric Separators and its Applications. [Citation Graph (0, 0)][DBLP ] Symposium on Computational Geometry, 1993, pp:99-108 [Conf ] A. Corbalan , M. L. Mazón , Tomás Recio , Francisco Santos On the Topological Shape of Planar Voronoi Diagrams. [Citation Graph (0, 0)][DBLP ] Symposium on Computational Geometry, 1993, pp:109-115 [Conf ] Christian Icking , Rolf Klein , Ngoc-Minh Lê , Lihong Ma Convex Distance Functions in 3-Space are Different. [Citation Graph (0, 0)][DBLP ] Symposium on Computational Geometry, 1993, pp:116-123 [Conf ] Rolf Klein , Andrzej Lingas A Linear-Time Randomized Algorithm for the Bounded Voronoi Diagram of a Simple Polygon. [Citation Graph (0, 0)][DBLP ] Symposium on Computational Geometry, 1993, pp:124-132 [Conf ] David G. Kirkpatrick , Jack Snoeyink Tentative Prune-and-Search for Computing Voronoi Vertices. [Citation Graph (0, 0)][DBLP ] Symposium on Computational Geometry, 1993, pp:133-142 [Conf ] Yui-Bin Chen , Doug Ierardi Optimal Motion Planning for a Rod in the Plane Subject to Velocity Constraints. [Citation Graph (0, 0)][DBLP ] Symposium on Computational Geometry, 1993, pp:143-152 [Conf ] Zhenyu Li , Victor Milenkovic A Compaction Algorithm for Non-Convex Polygons and Its Application. [Citation Graph (0, 0)][DBLP ] Symposium on Computational Geometry, 1993, pp:153-162 [Conf ] Steven Fortune , Christopher J. Van Wyk Efficient Exact Arithmetic for Computational Geometry. [Citation Graph (0, 0)][DBLP ] Symposium on Computational Geometry, 1993, pp:163-172 [Conf ] Sándor P. Fekete , William R. Pulleyblank Area Optimization of Simple Polygons. [Citation Graph (0, 0)][DBLP ] Symposium on Computational Geometry, 1993, pp:173-182 [Conf ] Marshall W. Bern , David Eppstein Worst-Case Bounds for Subadditive Geometric Graphs. [Citation Graph (0, 0)][DBLP ] Symposium on Computational Geometry, 1993, pp:183-188 [Conf ] Alok Aggarwal , Baruch Schieber , Takeshi Tokuyama Finding a Minimum Weight K-Link Path in Graphs with Monge Property and Applications. [Citation Graph (0, 0)][DBLP ] Symposium on Computational Geometry, 1993, pp:189-197 [Conf ] Matthew J. Katz , Micha Sharir An Expander-Based Approach to Geometric Optimization. [Citation Graph (0, 0)][DBLP ] Symposium on Computational Geometry, 1993, pp:198-207 [Conf ] Thomas Dubé Dominance Range-Query: The One-Reporting Case. [Citation Graph (0, 0)][DBLP ] Symposium on Computational Geometry, 1993, pp:208-217 [Conf ] Herbert Edelsbrunner The Union of Balls and Its Dual Shape. [Citation Graph (0, 0)][DBLP ] Symposium on Computational Geometry, 1993, pp:218-231 [Conf ] Cecil Jose A. Delfinado , Herbert Edelsbrunner An Incremental Algorithm for Betti Numbers of Simplicial Complexes. [Citation Graph (0, 0)][DBLP ] Symposium on Computational Geometry, 1993, pp:232-239 [Conf ] Ketan Mulmuley Dehn-Sommerville Relations, Upper Bound Theorem, and Levels in Arrangements. [Citation Graph (0, 0)][DBLP ] Symposium on Computational Geometry, 1993, pp:240-246 [Conf ] Jack Snoeyink , Jorge Stolfi Objects That Cannot be Taken Apart with Two Hands. [Citation Graph (0, 0)][DBLP ] Symposium on Computational Geometry, 1993, pp:247-256 [Conf ] Noga Alon , Sridhar Rajagopalan , Subhash Suri Long Non-Crossing Configurations in the Plane. [Citation Graph (0, 0)][DBLP ] Symposium on Computational Geometry, 1993, pp:257-263 [Conf ] János Pach , Jenö Töröcsik Some Geometric Applications of Dilworth's Theorem. [Citation Graph (0, 0)][DBLP ] Symposium on Computational Geometry, 1993, pp:264-269 [Conf ] Tamal K. Dey , Herbert Edelsbrunner Counting Triangle Crossings and Halving Planes. [Citation Graph (0, 0)][DBLP ] Symposium on Computational Geometry, 1993, pp:270-273 [Conf ] L. Paul Chew Guaranteed-Quality Mesh Generation for Curved Surfaces. [Citation Graph (0, 0)][DBLP ] Symposium on Computational Geometry, 1993, pp:274-280 [Conf ] Marshall W. Bern Compatible Tetrahedralizations. [Citation Graph (0, 0)][DBLP ] Symposium on Computational Geometry, 1993, pp:281-288 [Conf ] Nancy M. Amato , Franco P. Preparata An NC Parallel 3D Convex Hull Algorithm. [Citation Graph (0, 0)][DBLP ] Symposium on Computational Geometry, 1993, pp:289-297 [Conf ] Frank K. H. A. Dehne , Andreas Fabri , Andrew Rau-Chaplin Scalable Parallel Geometric Algorithms for Coarse Grained Multicomputers. [Citation Graph (1, 0)][DBLP ] Symposium on Computational Geometry, 1993, pp:298-307 [Conf ] Joseph S. B. Mitchell Shortest Paths Among Obstacles in the Plane. [Citation Graph (0, 0)][DBLP ] Symposium on Computational Geometry, 1993, pp:308-317 [Conf ] Michael T. Goodrich , Roberto Tamassia Dynamic Ray Shooting and Shortest Paths Via Balanced Geodesic Triangulations. [Citation Graph (0, 0)][DBLP ] Symposium on Computational Geometry, 1993, pp:318-327 [Conf ] Michel Pocchiola , Gert Vegter The Visibility Complex. [Citation Graph (0, 0)][DBLP ] Symposium on Computational Geometry, 1993, pp:328-337 [Conf ] Pankaj K. Agarwal , Noga Alon , Boris Aronov , Subhash Suri Can Visibility Graphs be Represented Compactly? [Citation Graph (0, 0)][DBLP ] Symposium on Computational Geometry, 1993, pp:338-347 [Conf ] Paul J. Heffernan An Optimal Algorithm for the Two-Guard Problem. [Citation Graph (0, 0)][DBLP ] Symposium on Computational Geometry, 1993, pp:348-358 [Conf ] Ashim Garg , Michael T. Goodrich , Roberto Tamassia Area-Efficient Upward Tree Drawings. [Citation Graph (0, 0)][DBLP ] Symposium on Computational Geometry, 1993, pp:359-368 [Conf ] Esther M. Arkin , Henk Meijer , Joseph S. B. Mitchell , David Rappaport , Steven Skiena Decision Trees for Geometric Models. [Citation Graph (0, 0)][DBLP ] Symposium on Computational Geometry, 1993, pp:369-378 [Conf ] Y. B. Karasik , Micha Sharir The Power of Geometric Duality and Minkowski Sums in Optical Computational Geometry. [Citation Graph (0, 0)][DBLP ] Symposium on Computational Geometry, 1993, pp:379-388 [Conf ] Seth J. Teller Visualizing Fortune's Sweepline Algorithm for Planar Voronoi Diagrams. [Citation Graph (0, 0)][DBLP ] Symposium on Computational Geometry, 1993, pp:393- [Conf ] David P. Dobkin , Ayellet Tal Building and Using Polyhedral Hierarchies. [Citation Graph (0, 0)][DBLP ] Symposium on Computational Geometry, 1993, pp:394- [Conf ] Stefan Schirra Moving a Disc Between Polygons. [Citation Graph (0, 0)][DBLP ] Symposium on Computational Geometry, 1993, pp:395-396 [Conf ] John Hershberger Compliant Motion in a Simple Polygon. [Citation Graph (0, 0)][DBLP ] Symposium on Computational Geometry, 1993, pp:397-398 [Conf ] Estarose Wolfson , Micha Sharir Implementation of a Motion Planning System in Three Dimensions. [Citation Graph (0, 0)][DBLP ] Symposium on Computational Geometry, 1993, pp:399-400 [Conf ] Pedro Jussieu de Rezende , Welson R. Jacometti Animation of Geometric Algorithms Using GeoLab. [Citation Graph (0, 0)][DBLP ] Symposium on Computational Geometry, 1993, pp:401-402 [Conf ] Michael Murphy , Steven Skiena Ranger: A Tool for Nearest Neighbor Search in High Dimensions. [Citation Graph (0, 0)][DBLP ] Symposium on Computational Geometry, 1993, pp:403-404 [Conf ] Jack Snoeyink Video: Objects that Cannot be Taken Apart with Two Hands. [Citation Graph (0, 0)][DBLP ] Symposium on Computational Geometry, 1993, pp:405- [Conf ]