Google
Google Scholar
MS Academic
CiteSeerX
CORE
Semantic Scholar15th Symposium on Computational Geometry 1999: Miami Beach, Florida, USA
- Victor Milenkovic:
Proceedings of the Fifteenth Annual Symposium on Computational Geometry, Miami Beach, Florida, USA, June 13-16, 1999. ACM 1999, ISBN 1-58113-068-6 - Siu-Wing Cheng
, Tamal K. Dey, Herbert Edelsbrunner, Michael A. Facello, Shang-Hua Teng:
Sliver Exudation. 1-13 - Oswin Aichholzer:
The Path of a Triangulation. 14-23 - Herbert Edelsbrunner, Daniel R. Grayson:
Edgewise Subdivision of a Simplex. 24-30 - Marc J. van Kreveld, Joseph S. B. Mitchell, Peter Rousseeuw, Micha Sharir, Jack Snoeyink, Bettina Speckmann:
Efficient Algorithms for Maximum Regression Depth. 31-40 - Tetsuo Asano, Mark de Berg, Otfried Cheong, Leonidas J. Guibas, Jack Snoeyink, Hisao Tamaki:
Spanning Trees Crossing Few Barriers. 41-48 - Sergei Bespamyatnikh, David G. Kirkpatrick, Jack Snoeyink:
Generalizing Ham Sandwich Cuts to Equitable Subdivisions. 49-58 - Steven Fortune:
Topological Beam Tracing. 59-68 - Marco Pellegrini:
A Geometric Approach to Computing Higher Order Form Factors. 69-78 - Martin Gavrilov, Piotr Indyk, Rajeev Motwani, Suresh Venkatasubramanian:
Geometric Pattern Matching: A Performance Study. 79-85 - Karsten Weihe, Ulrik Brandes, Annegret Liebers, Matthias Müller-Hannemann, Dorothea Wagner, Thomas Willhalm:
Empirical Design of Geometric Algorithms. 86-94 - Robert-Paul Berretty, Kenneth Y. Goldberg, Mark H. Overmars, A. Frank van der Stappen:
Geometric Algorithms for Trap Design. 95-104 - Erik D. Demaine, Martin L. Demaine, Joseph S. B. Mitchell:
Folding Flat Silhouettes and Wrapping Polyhedral Packages: New Results in Computational Origami. 105-114 - Richard J. Anderson, Sumeet Sobti:
The Table Layout Problem. 115-123 - János Pach, Joel Spencer, Géza Tóth:
New Bounds on Crossing Numbers. 124-133 - Alon Efrat:
The Complexity of the Union of (alpha, beta)-Covered Objects. 134-142 - Pankaj K. Agarwal, Micha Sharir:
Pipes, Cigars, and Kreplach: The Union of Minkowski Sums in Three Dimensions. 143-153 - Boris Aronov, Tamal K. Dey:
Polytopes in Arrangements. 154-162 - Sigal Raab:
Controlled Perturbation for Arrangements of Polyhedral Surfaces with Application to Swept Volumes. 163-172 - Steven A. Wilmarth, Nancy M. Amato, Peter F. Stiller:
Motion Planning for a Rigid Body Using Random Networks on the Medial Axis of the Free Space. 173-180 - Olivier Devillers:
On Deletion in Delaunay Triangulations. 181-188 - Christopher M. Gold:
Crust and Anti-Crust: A One-Step Boundary and Skeleton Extraction Algorithm. 189-196 - Tamal K. Dey, Kurt Mehlhorn, Edgar A. Ramos:
Curve Reconstruction: Connecting Dots with Good Reason. 197-206 - Joachim Giesen:
Curve Reconstruction, the Traveling Salesman Problem and Menger's Theorem on Length. 207-216 - Sándor P. Fekete, Henk Meijer:
On Minimum Stars, Minimum Steiner Stars, and Maximum Matchings. 217-226 - Siu-Wing Cheng, Hazel Everett, Otfried Cheong, René van Oostrum:
Hierarchical Vertical Decompositions, Ray Shooting, and Circular Arc Queries in Simple Polygons. 227-236 - John Hershberger, Subhash Suri:
Kinetic Connectivity of Rectangles. 237-246 - Pankaj K. Agarwal, Julien Basch, Mark de Berg, Leonidas J. Guibas, John Hershberger:
Lower Bounds for Kinetic Planar Subdivisions. 247-254 - Leonidas J. Guibas, Menelaos I. Karavelas:
Interval Methods for Kinetic Simulations. 255-264 - Leonidas J. Guibas, David Hsu, Li Zhang:
H-Walk: Hierarchical Distance Computation for Moving Convex Bodies. 265-273 - Ileana Streinu:
Stretchability of Star-Like Pseudo-Visibility Graphs. 274-280 - Jae-Ha Lee, Sung Yong Shin, Kyung-Yong Chwa:
Visibility-Based Pursuit-Evasion in a Polygonal Room with a Door. 281-290 - Christian Icking, Rolf Klein, Lihong Ma, Stefan Nickel, Ansgar Weißler:
On Bisectors for Different Distance Functions. 291-299 - Satish Rao:
Small Distortion and Volume Preserving Embeddings for Planar and Euclidean Metrics. 300-306 - Pedro A. Ramos:
Computing Roundness is Easy if the Set is Almost Round. 307-315 - David Lutterkort, Jörg Peters:
Smooth Paths in a Polygonal Channel. 316-321 - Danny Z. Chen, Ovidiu Daescu, Xiaobo Hu, Xiaodong Wu, Jinhui Xu:
Determining an Optimal Penetration Among Weighted Regions in Two and Three Dimensions. 322-331 - Chandrajit L. Bajaj, Guoliang Xu:
Error Bounded Regular Algebraic Spline Curves. 332-340 - Christoph Burnikel, Rudolf Fleischer, Kurt Mehlhorn, Stefan Schirra:
Efficient Exact Geometric Computation Made Easy. 341-350 - Vijay Karamcheti, Chen Li, Igor Pechtchanski, Chee-Keng Yap:
A Core Library for Robust Numeric and Geometric Computation. 351-359 - John Keyser, Tim Culver, Dinesh Manocha, Shankar Krishnan:
MAPC: A Library for Efficient and Exact Manipulation of Algebraic Points and Curves. 360-369 - Jean-Daniel Boissonnat, Jack Snoeyink:
Efficient Algorithms for Line and Curve Segment Intersection Using Restricted Predicates. 370-379 - Pankaj K. Agarwal, Boris Aronov, Sariel Har-Peled, Micha Sharir:
Approximation and Exact Algorithms for Minimum-Width Annuli and Shells. 380-389 - Edgar A. Ramos:
On Range Reporting, Ray Shooting and k-Level Construction. 390-399 - Shakhar Smorodinsky, Joseph S. B. Mitchell, Micha Sharir:
Sharp Bounds on Geometric Permutations of Pairwise Disjoint Balls inRd. 400-406 - Erik D. Demaine, Martin L. Demaine, Anna Lubiw, Joseph O'Rourke, Irena Pashchenko:
Metamorphosis of the Cube. 409-410 - Konrad Polthier, Markus Schmies, Martin Steffens, Christian Teitzel:
The Video "Geodesics and Waves". 411-412 - Maria Shneerson, Avner Shapiro, Ayellet Tal:
Polyhedron Realization and Its Application to Metamorphosis. 413-414 - Arthur D. Gregory, Andrei State, Ming C. Lin, Dinesh Manocha, Mark A. Livingston:
Feature-Based Surface Decomposition for Polyhedral Morphing. 415-416 - Gill Barequet, Christian A. Duncan, Michael T. Goodrich, Subodh Kumar, Mihai Pop:
Efficient Perspective-Accurate Silhouette Computation. 417-418 - Martin Isenburg, Jack Snoeyink:
Mesh Collapse Compression. 419-420 - Jean-Daniel Boissonnat, Frédéric Cazals, Frank Da, Olivier Devillers, Sylvain Pion, François Rebufat, Monique Teillaud, Mariette Yvinec:
Programming with CGAL: The Example of Triangulations. 421-422 - Nina Amenta:
The Crust Algorithm for 3D Surface Reconstruction. 423-424 - David P. Dobkin, Alejo Hausner, Emden R. Gansner, Stephen C. North:
Uncluttering Force-Directed Graph Layouts. 425-426 - Julien Basch, João Comba, Leonidas J. Guibas, John Hershberger, Craig Silverstein, Li Zhang:
Kinetic Data Structures: Animating Proofs Through Time. 427-428 - Andy Wilson, Eric Larsen, Dinesh Manocha, Ming C. Lin:
Graph Partitioning and Ordering for Interactive Proximity Queries. 429-430
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.
last updated on 2020-08-10 23:43 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
the dblp computer science bibliography is funded by:
