default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID12th SCG 1996: Philadelphia, PA, USA
- Sue Whitesides:
Proceedings of the Twelfth Annual Symposium on Computational Geometry, Philadelphia, PA, USA, May 24-26, 1996. ACM 1996, ISBN 0-89791-804-5
Regular Papers
- Jeff Erickson:
New Lower Bounds for Convex Hull Problems in Odd Dimensions. 1-9 - Nina Amenta, Günter M. Ziegler
:
Shadows and Slices of Polytopes. 10-19 - Otfried Schwarzkopf, Micha Sharir:
Vertical Decomposition of a Single Cell in a Three-Dimensional Arrangement of Surfaces and Its Applications. 20-29 - Stefan Felsner:
On the Number of Arrangements of Pseudolines. 30-37 - Gill Barequet, Matthew Dickerson, David Eppstein:
On Triangulating Three-Dimensional Polygons. 38-47 - Scott A. Mitchell, Stephen A. Vavasis:
An Aspect Ratio Bound for Triangulating a d-Grid Cut by a Hyperplane (Extended Abstract). 48-57 - David Eppstein:
Linear Complexity Hexahedral Mesh Generation. 58-67 - Sandy Irani, Prabhakar Raghavan:
Combinatorial and Experimental Results for Randomized Point Matching Algorithms. 68-77 - Satyan R. Coorg, Seth J. Teller:
Temporally Coherent Conservative Visibility (Extended Abstract). 78-87 - Chandrajit L. Bajaj, Valerio Pascucci:
Splitting a Complex of Convex Polytopes In Any Dimension. 88-97 - Robert J. Lang:
A Computational Algorithm for Origami Design. 98-105 - Micha Sharir:
A Near-Linear Algorithm for the Planar 2-Center Problem. 106-112 - Matthew J. Katz, Frank Nielsen:
On Piercing Sets of Objects. 113-121 - Micha Sharir, Emo Welzl:
Rectilinear and Polygonal p-Piercing and p-Center Problems. 122-132 - Wei Chen, Koichi Wada, Kimio Kawaguchi:
Parallel Robust Algorithms for Constructing Strongly Convex Hulls. 133-140 - Jonathan Richard Shewchuk:
Robust Adaptive Floating-Point Geometric Predicates. 141-150 - Simon Kahan, Jack Snoeyink:
On the Bit Complexity of Minimum Link Paths: Superquadratic Algorithms for Problems Solvable in Linear Time. 151-158 - Kurt Mehlhorn, Stefan Näher, Thomas Schilz, Stefan Schirra, Michael Seel, Raimund Seidel, Christian Uhrig:
Checking Geometric Programs or Verification of Geometric Structures. 159-165 - Nancy M. Amato, Edgar A. Ramos:
On Computing Voronoi Diagrams by Divide-Prune-and-Conquer. 166-175 - Neelima Gupta, Sandeep Sen:
Faster Output-Sensitive Parallel Convex Hulls for d<=3: Optimal Sublogarithmic Algorithms for Small Outputs. 176-185 - Guy E. Blelloch, Gary L. Miller, Dafna Talmor:
Developing a Practical Projection-Based Parallel Delaunay Algorithm. 186-195 - Siu-Wing Cheng, Yin-Feng Xu:
Approaching the Largest beta-Skeleton within a Minimum Weight Triangulation. 196-203 - Matthew Dickerson, Mark H. Montague:
A (Usually?) Connected Subgraph of the Minimum Weight Triangulation. 204-213 - Ferran Hurtado, Marc Noy, Jorge Urrutia:
Flipping Edges in Triangulations. 214-223 - Tomonari Masada, Hiroshi Imai, Keiko Imai:
Enumeration of Regular Triangulations. 224-233 - G. D. Ramkumar:
An Algorithm to Compute the Minkowski Sum Outer-face of Two Simple Polygons. 234-241 - Jean-Daniel Boissonnat, Sylvain Lazard:
A Polynomial-Time Algorithm for Computing a Shortest Path of Bounded Curvature Amidst Moderate Obstacles (Extended Abstract). 242-251 - Tetsuo Asano, David G. Kirkpatrick, Chee-Keng Yap:
d1-Optimal Motion for a Rod (Extended Abstract). 252-263 - Kathleen Romanik, Sven Schuierer:
Optimal Robot Localization in Trees. 264-273 - Ernst P. Mücke, Isaac Saias, Binhai Zhu:
Fast Randomized Point Location Without Preprocessing in Two- and Three-dimensional Delaunay Triangulations. 274-283 - Timothy M. Chan:
Fixed-Dimensional Linear Programming Queries Made Easy. 284-290 - Michel Pocchiola, Gert Vegter:
Pseudo-Triangulations: Theory and Applications. 291-300 - Alon Efrat, Alon Itai:
Improvements on Bottleneck Matching and Related Problems Using Geometry. 301-310 - Kasturi R. Varadarajan:
Approximating Monotone Polygonal Curves Using the Uniform Metric. 311-318 - Marek Chrobak, Michael T. Goodrich, Roberto Tamassia:
Convex Drawings of Graphs in Two and Three Dimensions (Preliminary Version). 319-328 - Sariel Har-Peled, Micha Sharir, Kasturi R. Varadarajan:
Approximating Shortest Paths on a Convex Polytope in Three Dimensions. 329-338 - Joonsoo Choi, Chee-Keng Yap:
Monotonicity of Rectilinear Geodesics in d-Space (Extended Abstract). 339-348 - Daniel A. Spielman, Shang-Hua Teng:
Disk Packings and Planar Separators. 349-358 - Gyula Károlyi, János Pach, Géza Tóth:
Ramsey-Type Results for Geometric Graphs. 359-365
Communications
- Mary Inaba, Hiroshi Imai, Naoki Katoh:
Experimental Results of Randomized Clustering Algorithm. C-1-C-2 - James E. Baker, Isabel F. Cruz, Giuseppe Liotta, Roberto Tamassia:
Animating Geometric Algorithms Over the Web. C-3-C-4 - Mark de Berg, René van Oostrum, Mark H. Overmars:
Simple Traversal of a Subdivision Without Extra Storage. C-5-C-6 - Ferran Hurtado, Marc Noy:
The Graph of Triangulations of a Convex Polygon. C-7-C-8 - Gill Barequet, Micha Sharir:
Partial Surface Matching by Using Directed Footprints. C-9-C-10 - David Avis, Prosenjit Bose, Godfried T. Toussaint, Thomas C. Shermer, Binhai Zhu, Jack Snoeyink:
On the Sectional Area of Convex Polytopes. C-11-C-12 - Elmar Schömer, Jürgen Sellen, Marek Teichmann, Chee-Keng Yap:
Smallest Enclosing Cylinders. C-13-C-14 - Klara Kedem, Yana Yarmovski:
Curve Based Stereo Matching Using the Minimum Hausdorff Distance. C-15-C-18 - Chandrasekhar Pisupati, Lawrence B. Wolff, Wayne Mitzner, Elias A. Zerhouni:
Geometric Tree Matching with Applications to 3D Lung Structures. C-19-C-20
Videos
- Nina Amenta:
Four-Polytopes and a Funeral (for my conjecture). V-1-V-2 - Sherif Ghali, A. James Stewart:
Maintenance of the Set of Segments Visible from a Moving Viewpoint in Two Dimensions. V-3-V-4 - Brian Mirtich, John F. Canny:
Testing Control Systems Through Dynamic Simulation. V-5-V-6 - Patrice Belleville, J. Mark Keil, Michael McAllister, Jack Snoeyink:
On Computing Edges That Are In All Minimum-Weight Triangulations. V-7-V-8 - Matthew Dickerson, Daniel Scharstein:
The Rotation Diagram and Optimal Containing Placements of a Convex Polygon. V-9-V-10 - Frédo Durand, Rachel Orti, Stéphane Rivière, Claude Puech:
Radiosity in Flatland Made Visibly Simple: Using the Visibility Complex for Lighting Simulation of Dynamic Scenes in Flatland. V-11-V-12 - Martin Held, James T. Klosowski, Joseph S. B. Mitchell:
Collision Detection for Fly-Throughs in Virtual Environments. V-13-V-14 - Subodh Kumar, Dinesh Manocha:
The Power of Coherence: Fast Tessellation of Surfaces. V-15-V-16 - Tsuyoshi Ono, Yoshiaki Kyoda, Tomonari Masada, Kazuyoshi Hayase, Tetsuo Shibuya, Motoki Nakade, Mary Inaba, Hiroshi Imai, Keiko Imai, David Avis:
A Package for Triangulations. V-17-V-18
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-06-19 01:21 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:
