default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID11th SCG 1995: Vancouver, B.C., Canada
- Jack Snoeyink:
Proceedings of the Eleventh Annual Symposium on Computational Geometry, Vancouver, B.C., Canada, June 5-12, 1995. ACM 1995, ISBN 0-89791-724-3
Regular Papers
- Peter Gritzmann, Alexander Hufnagel:
A Polynomial Time Algorithm for Minkowski Reconstruction. 1-9 - Timothy M. Chan:
Output-Sensitive Results on Convex Hulls, Extreme Points, and Related Problems. 10-19 - David Avis, David Bremner:
How Good are Convex Hull Algorithms? 20-28 - Mark H. Overmars, Anil S. Rao, Otfried Schwarzkopf, Chantal Wentink:
Immobilizing Polygons against a Wall. 29-38 - Pankaj K. Agarwal, Alon Efrat
, Micha Sharir:
Vertical Decomposition of Shallow Levels in 3-Dimensional Arrangements and Its Applications. 39-50 - Elmar Schömer, Christian Thiel:
Efficient Collision Detection for Moving Polyhedra. 51-60 - Peter Su, Robert L. (Scot) Drysdale III:
A Comparison of Sequential Delaunay Triangulation Algorithms. 61-70 - Manuel Abellanas, Gregorio Hernández-Peñalver, Rolf Klein, Victor Neumann-Lara, Jorge Urrutia:
Voronoi Diagrams and Containment of Families of Convex Sets on the Plane. 71-78 - Jean-Daniel Boissonnat, Micha Sharir, Boaz Tagansky, Mariette Yvinec:
Voronoi Diagrams in Higher Dimensions under Certain Polyhedral Distance Functions. 79-88 - Helmut Alt, Otfried Schwarzkopf:
The Voronoi Diagram of Curved Objects. 89-97 - Herbert Edelsbrunner, Roman Waupotitsch:
A Combinatorial Approach to Cartograms. 98-108 - Frank Wagner, Alexander Wolff:
Map Labeling Heuristics: Provably Good and Practically Useful. 109-118 - Ulrich Finke, Klaus H. Hinrichs:
Overlaying Simply Connected Planar Subdivisions in Linear Time. 119-126 - Jeff Erickson:
New Lower Bounds for Hopcroft's Problem (Extended Abstract). 127-137 - Jirí Matousek:
A Helly-Type Theorem for Unions of Convex Sets. 138-146 - László Lovász, János Pach, Mario Szegedy:
On Conway's Thrackle Conjecture. 147-151 - Sergei Bespamyatnikh:
An Optimal Algorithm for Closest Pair Maintenance (Extended Abstract). 152-161 - Prosenjit Gupta, Ravi Janardan, Michiel H. M. Smid, Bhaskar DasGupta:
The Rectangle Enclosure and Point-Dominance Problems Revisited. 162-171 - Sunil Arya, David M. Mount:
Approximate Range Searching. 172-181 - Pankaj K. Agarwal, Otfried Schwarzkopf, Micha Sharir:
The Overlay of Lower Envelopes in Three Dimensions and Its Applications. 182-189 - Leonidas J. Guibas, David H. Marimont:
Rounding Arrangements Dynamically. 190-199 - Boaz Tagansky:
A New Technique for Analyzing Substructures in Arrangements. 200-210 - Ivan J. Balaban:
An Optimal Algorithm for Finding Segments Intersections. 211-219 - Oswin Aichholzer, Franz Aurenhammer, Michael Taschwer, Günter Rote:
Triangulations Intersect Nicely. 220-229 - Hisao Tamaki, Takeshi Tokuyama:
How to Cut Pseudo-Parabolas into Segments. 230-237 - Matthew Dickerson, Scott A. McElfresh, Mark H. Montague:
New Algorithms and Empirical Findings on Minimum Weight Triangulation Heuristics (Extended Abstract). 238-247 - Michel Pocchiola, Gert Vegter:
Computing the Visibility Graph via Pseudo-Triangulations. 248-257 - Christian Icking, Rolf Klein:
Searching for the Kernel of a Polygon - A Competitive Strategy. 258-266 - Pankaj K. Agarwal, Boris Aronov, Subhash Suri:
Stabbing Triangulations by Lines in 3D. 267-276 - Ashutosh Rege:
A Complete and Practical Algorithm for Geometric Theorem Proving (Extended Abstract). 277-286 - Marco Pellegrini:
Monte Carlo Approximation of Form Factors with Error Bounded a Priori. 287-296 - Bernard Chazelle, David P. Dobkin, Nadia Shouraboura, Ayellet Tal:
Strategies for Polyhedral Surface Decomposition: An Experimental Study. 297-305 - Giuseppe Di Battista, Ashim Garg, Giuseppe Liotta, Roberto Tamassia, Emanuele Tassinari, Francesco Vargiu:
An Experimental Comparison of Three Graph Drawing Algorithms (Extended Abstract). 306-315 - Boris Aronov, Alan R. Davis, Tamal K. Dey, Sudebkumar Prasant Pal, D. Chithra Prasad:
Visibility with Reflection. 316-325 - Pankaj K. Agarwal, Micha Sharir:
Efficient Randomized Algorithms for Some Geometric Optimization Problems. 326-335 - Sunil Arya, David M. Mount, Onuttom Narayan:
Accounting for Boundary Effects in Nearest Neighbor Searching. 336-344 - Martin E. Dyer:
A Parallel Algorithm for Linear Programming in Fixed Dimension. 345-349 - Joonsoo Choi, Jürgen Sellen, Chee-Keng Yap:
Precision-Sensitive Euclidean Shortest Path in 3-Space (Extended Abstract). 350-359 - Cristian S. Mata, Joseph S. B. Mitchell:
Approximation Algorithms for Geometric Tour and Network Design Problems (Extended Abstract). 360-369 - Danny Z. Chen, Kevin S. Klenk, Hung-Yi Tu:
Shortest Path Queries Among Weighted Obstacles in the Rectilinear Plane. 370-379 - Joonsoo Choi, Chee-Keng Yap:
Rectilinear Geodesics in 3-Space (Extended Abstract). 380-389
Communications
- Vishwa Ranjan, Alain Fournier:
Union of Spheres (UoS) Model for Volumetric Data. C2-C3 - Steven E. Benzley, Ted D. Blacker, Scott A. Mitchell, Peter Murdoch, Timothy J. Tautges:
Hexahedral Mesh Generation via the Dual. C4-C5 - Michel F. Sanner, Arthur J. Olson, Jean-Claude Spehner:
Fast and Robust Computation of Molecular Surfaces. C6-C7 - Shankar Krishnan, Atul Narkhede, Dinesh Manocha:
Representation and Computation of Boolean Combinations of Sculptured Models. C8-C9 - Otfried Schwarzkopf:
The Extensible Drawing Editor Ipe. C10-C11 - Nina Amenta, Stuart Levy, Tamara Munzner, Mark Phillips:
Geomview: A System for Geometric Visualization. C12-C13 - Robert R. Lewis:
VideHoc: A Visualizer for Homogeneous Coordinates. C14-C15 - Francis Avnaim, Jean-Daniel Boissonnat, Olivier Devillers, Franco P. Preparata, Mariette Yvinec:
Evaluation of a New Method to Compute Signs of Determinants. C16-C17 - Christoph Burnikel, Jochen Könemann, Kurt Mehlhorn, Stefan Näher, Stefan Schirra, Christian Uhrig:
Exact Geometric Computation in LEDA. C18-C19 - Jean-Daniel Boissonnat, Katrin Dobrindt, Bernhard Geiger, Henri Michel:
A Global Motion Planner for a Mobile Robot on a Terrain. C20-C21 - Anil S. Rao, David J. Kriegman, Kenneth Y. Goldberg:
Complete Algorithms for Reorienting Polyhedral Parts Using a Pivoting Gripper. C22-C23 - D. S. Andrews, Jack Snoeyink:
Geometry in GIS is not Combinatorial: Segment Intersection for Polygon Overlay. C24-C25 - Mark de Berg, Katrin Dobrindt:
On Levels of Detail in Terrains. C26-C27 - Dorothea Wagner, Karsten Weihe:
An Animated Library of Combinatorial VLSI-Routing Algorithms. C28-C29 - Berto van de Kraats, Marc J. van Kreveld, Mark H. Overmars:
Printed Circuit Board Simplification: Simplifying Subdivisions in Practice. C30-C31 - Michael H. Goldwasser:
An Implementation for Maintaining Arrangements of Polygons. C32-C33 - Christian Schwarz, Jürgen Teich, Alek Vainshtein, Emo Welzl, Brian L. Evans:
Minimal Enclosing Parallelogram with Application. C34-C35 - Stéphane Rivière:
Topologically Sweeping the Visibility Complex of Polygonal Scenes. C36-C37
Video Review
- Frédo Durand, Claude Puech:
The Visibility Complex Made Visibly Simple: An Introduction to 2D Structures of Visibility. V2 - Steven C. Glassman, Greg Nelson:
An Animation of Euclid's Proposition 47: The Pythagorean Theorem. V3-V4 - Leo Joskowicz, Elisha Sacks:
HIPAIR: Interactive Mechanism Analysis and Design Using Configuration Spaces. V5-V6 - Madhav K. Ponamgi, Ming C. Lin, Dinesh Manocha:
Incremental Collision Detection for Polygonal Models. V7-V8 - Bernard Chazelle, David P. Dobkin, Nadia Shouraboura, Ayellet Tal:
Convex Surface Decomposition. V9-V10 - Bernhard Geiger:
3D Modeling using the Delaunay Triangulation. V11-V12
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 2025-04-16 21:26 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
