default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID13th SCG 1997: Nice, France
- Jean-Daniel Boissonnat:
Proceedings of the Thirteenth Annual Symposium on Computational Geometry, Nice, France, June 4-6, 1997. ACM 1997, ISBN 0-89791-878-9
Applied Track: Rendering and Manipulation
- Thomas C. Hudson, Dinesh Manocha, Jonathan D. Cohen, Ming C. Lin, Kenneth E. Hoff III, Hansong Zhang:
Accelerated Occlusion Culling using Shadow Frusta. 1-10 - Frédéric Cazals
, Claude Puech:
Bucket-Like Space Partitioning Data Structures with Applications to Ray-Tracing. 11-20 - Robert-Paul Berretty, Kenneth Y. Goldberg, Mark H. Overmars, A. Frank van der Stappen:
On Fence Design and the Complexity of Push Plans for Orienting Parts. 21-29
Theoretical Track: Arrangements
- Pankaj K. Agarwal, Boris Aronov, Micha Sharir:
On Levels in Arrangements of Lines, Segments, Planes, and Triangles. 30-38 - Pankaj K. Agarwal, Leonidas J. Guibas, T. M. Murali, Jeffrey Scott Vitter:
Cylindrical Static and Kinetic Binary Space Partitions. 39-48 - David Bremner, Komei Fukuda, Ambros Marzetta:
Primal-Dual Methods for Vertex and Facet Enumeration (Preliminary Version). 49-56 - Edgar A. Ramos:
Construction of 1-d Lower Envelopes and Applications. 57-66
Applied Track: Solid Modeling and Meshing
- Jean-Daniel Boissonnat, Eelco de Lange, Monique Teillaud:
Minkowski Operations for Satellite Antenna Layout. 67-76 - Srinivas Raghothama, Vadim Shapiro:
Necessary Conditions for Boundary Representation Variance. 77-86 - Scott A. Mitchell:
Choosing Corners of Rectangles for Mapped Meshing. 87-93
Theoretical Track: Combinatorial Geometry
- Gyula Károlyi, János Pach, Géza Tóth, Pavel Valtr:
Ramsey-Type Results for Geometric Graphs II. 94-103 - Alon Efrat, Micha Sharir:
On the Complexity of the Union of Fat Objects in the Plane. 104-112 - Sergey P. Tarasov, Michael N. Vyalyi:
Some PL Functions on Surfaces are not Height Functions. 113-118 - Joseph O'Rourke, Ileana Streinu:
Vertex-Edge Pseudo-Visibility Graphs: Characterization and Recognition. 119-128
Theoretical Track: Circle Problems
- Kurt Mehlhorn, Thomas C. Shermer, Chee-Keng Yap:
A Complete Roundness Classification Procedure. 129-138 - Jesus Garcia-Lopez, Pedro A. Ramos:
Fitting a Set of Points by a Circle. 139-146 - Pankaj K. Agarwal, Micha Sharir, Emo Welzl:
The Discrete 2-Center Problem. 147-155
Applied Track: Accuracy and Robustness
- Giuseppe Liotta, Franco P. Preparata, Roberto Tamassia:
Robust Proximity Queries: An Illustration of Degree-Driven Algorithm Design. 156-165 - Hervé Brönnimann, Mariette Yvinec:
Efficient Exact Evaluation of Signs of Determinants. 166-173 - Hervé Brönnimann, Ioannis Z. Emiris, Victor Y. Pan, Sylvain Pion:
Computing Exact Geometric Predicates Using Modular Arithmetic with Single Precision. 174-182 - Dan Halperin, Christian R. Shelton:
A Perturbation Scheme for Spherical Arrangements with Application to Molecular Modeling. 183-192
Theoretical Track: Triangulations
- Matthias Müller-Hannemann, Karsten Weihe:
Minimum Strictly Convex Quadrangulations of Convex Polygons. 193-202 - Boris Aronov, Steven Fortune:
Average-Case Ray Shooting and Minimum Weight Triangulations. 203-211 - Marc J. van Kreveld, René van Oostrum, Chandrajit L. Bajaj, Valerio Pascucci, Daniel Schikore:
Contour Trees and Small Seed Sets for Isosurface Traversal. 212-220
Applied Track: Manufacturing and Reconstruction
- Hee-Kap Ahn, Mark de Berg, Prosenjit Bose, Siu-Wing Cheng, Dan Halperin, Jirí Matousek, Otfried Schwarzkopf:
Separating an Object from its Cast. 221-230 - Gill Barequet, Yuval Kaplan:
A Data Front-End for Layered Manufacturing. 231-239 - Seth Allen, Debasish Dutta:
Wall Thickness Control in Layered Manufacturing. 240-247 - Dominique Attali:
r-Regular Shape Reconstruction from Unorganized Points. 248-253
Applied Track: Shortest Path and Higher Dimensions
- Kurt Mehlhorn, Michael Müller, Stefan Näher, Stefan Schirra, Michael Seel, Christian Uhrig, Joachim Ziegler:
A Computational Basis for Higher-Dimensional Computational Geometry and Applications. 254-263 - Cristian S. Mata, Joseph S. B. Mitchell:
A New Algorithm for Computing Shortest Paths in Weighted Planar Subdivisions (Extended Abstract). 264-273 - Mark Lanthier, Anil Maheshwari, Jörg-Rüdiger Sack:
Approximating Weighted Shortest Paths on Polyhedral Surfaces. 274-283
Theoretical Track: Computational Models
- Michael T. Goodrich, Leonidas J. Guibas, John Hershberger, Paul J. Tanenbaum:
Snap Rounding Line Segments Efficiently in Two and Three Dimensions. 284-293 - Mark de Berg, Matthew J. Katz, A. Frank van der Stappen, Jules Vleugels:
Realistic Input Models for Geometric Algorithms. 294-303 - Jeff Erickson:
Space-Time Tradeoffs for Emptiness Queries (Extended Abstract). 304-313 - Tatsuya Akutsu, Hisao Tamaki, Takeshi Tokuyama:
Distribution of Distances and Triangles in a Point Set and Algorithms for Computing the Largest Common Point Sets. 314-323
Applied Track: Geometry Matching and Packing
- Paul W. Finn, Lydia E. Kavraki, Jean-Claude Latombe, Rajeev Motwani, Christian R. Shelton, Suresh Venkatasubramanian, Andrew Chi-Chih Yao:
RAPID: Randomized Pharmacophore Identification for Drug Design. 324-333 - Victor Milenkovic:
Rotational Polygon Overlap Minimization. 334-343
Theoretical Track: Proximity Problems
- Julien Basch, Leonidas J. Guibas, Li Zhang:
Proximity Problems on Moving Points. 344-351 - Timothy M. Chan:
Approximate Nearest Neighbor Queries Revisited. 352-358 - Sariel Har-Peled:
Approximate Shortest Paths and Geodesic Diameters on Convex Polytopes in Three Dimensions. 359-365
Applied Track: Communications
- Mahmoud Melkemi:
A-Shapes of a Finite Point Set. 367-369 - Jean H. Gallier:
Drawing Closed Rational Surfaces. 370-372 - Dong-Jin Kim, Leonidas J. Guibas, Sung Yong Shin:
Fast Collision Detection Among Multiple Moving Spheres. 373-375 - Leif Kobbelt:
Robust and Efficient Evaluation of Functionals on Parametric Surfaces. 376-378 - Maria Shneerson, Ayellet Tal:
GASP-II: A Geometric Algorithm Animation System for an Electronic Classroom. 379-381 - Pankaj K. Agarwal, T. M. Murali, Jeffrey Scott Vitter:
Practical Techniques for Constructing Binary Space Partitions for Orthogonal Rectangles. 382-384 - Pamela J. Vermeer:
Assembling Objects Through Parts Correlation. 385-387 - Julien Basch, Leonidas J. Guibas, Craig Silverstein, Li Zhang:
A Practical Evaluation of Kinetic Data Structures. 388-390 - L. Paul Chew:
Guaranteed-Quality Delaunay Meshing in 3D (Short Version). 391-393 - George N. Sazaklis, Esther M. Arkin, Joseph S. B. Mitchell, Steven Skiena:
Geometric Decision Trees for Optical Character Recognition (Extended Abstract). 394-396 - Ee-Chien Chang, Chee-Keng Yap:
A Wavelet Approach to Foveating Images. 397-399 - Jack Snoeyink, Marc J. van Kreveld:
Good Orders for Incremental (Re)construction. 400-402 - Thomas J. Peters, Neil F. Stewart, David R. Ferguson, P. S. Fussell:
Algorithmic Tolerances and Semantics in Data Exchange. 403-405 - Michiel Hagedoorn, Remco C. Veltkamp:
A General Method for Partial Point Set Matching. 406-408 - Jürgen Döllner, Klaus H. Hinrichs, Hermann Spiegel:
An Interactive Environment for Visualizing and Animating Algorithms. 409-411 - Gill Barequet, Stina S. Bridgeman, Christian A. Duncan, Michael T. Goodrich, Roberto Tamassia:
Classical Computational Geometry in GeomNet. 412-414 - Jon Christensen, Stacy Friedman, Joe Marks, Stuart M. Shieber:
Empirical Testing of Algorithms for Variable-Sized Label Placement. 415-417
Theoretical Track: Communications
- Oswin Aichholzer, Franz Aurenhammer, Danny Z. Chen, D. T. Lee, Asish Mukhopadhyay, Evanthia Papadopoulou:
Voronoi Diagrams for Direction-Sensitive Distances. 418-420 - Stéphane Rivière:
Dynamic Visibility in Polygonal Scenes with the Visibility Complex. 421-423 - Oleg R. Musin:
Properties of the Delaunay Triangulation. 424-426 - Jae-Ha Lee, Chan-Su Shin, Jae-Hoon Kim, Sung Yong Shin, Kyung-Yong Chwa:
New Competitive Strategies for Searching in Unknown Star-Shaped Polygons. 427-429 - Bernd Gärtner, Sven Schönherr:
Exact Primitives for Smallest Enclosing Ellipses. 430-432 - Helmut Alt, Emo Welzl, Barbara Wolfers:
Piecewise Linear Approximation of Bézier-Curves. 433-435 - Ulrich Fößmeier, Michael Kaufmann:
On Exact Solutions for the Rectilinear Steiner Tree Problem. 436-438 - Ileana Streinu:
Clusters of Stars. 439-441 - Li Zhang, Harish Devarajan, Julien Basch, Piotr Indyk:
Probabilistic Analysis for Combinatorial Functions of Moving Points. 442-444 - Alejandro López-Ortiz, Sven Schuierer:
Position-Independent Near Optimal Searching and On-Line Recognition in Star Polygons. 445-447 - Masafumi Yamashita, Hideki Umemoto, Ichiro Suzuki, Tsunehiko Kameda:
Searching for Mobile Intruders in a Polygonal Region by a Group of Mobile Searchers (Extended Abstract). 448-450 - Chung Keung Poon, Binhai Zhu, Francis Y. L. Chin:
A Polynomial Time Solution for Labeling a Rectilinear Map. 451-453 - Béla Bollobás, Gautam Das, Dimitrios Gunopulos, Heikki Mannila:
Time-Series Similarity Problems and Well-Separated Geometric Sets. 454-456 - Karl-Friedrich Böhringer, Bruce Randall Donald, Dan Halperin:
The Area Bisectors of a Polygon and Force Equilibria in Programmable Vector Fields. 457-459 - John Hershberger, Subhash Suri:
Efficient Breakout Routing in Printed Circuit Boards. 460-462 - Kensuke Onishi, Hiroshi Imai:
Voronoi Diagram in Statistical Parametric Space by Kullback-Leibler Divergence. 463-465 - Jörg Schwerdt, Michiel H. M. Smid, Stefan Schirra:
Computing the Minimum Diameter for Moving Points: An Exact Implementation Using Parametric Search. 466-468 - Julien Basch, Leonidas J. Guibas, G. D. Ramkumar:
Sweeping Lines and Line Segments with a Heap. 469-471
Video Review
- Gershon Elber, Myung-Soo Kim:
The Bisector Surface of Freeform Rational Space Curves. 473-474 - Frédo Durand, George Drettakis, Claude Puech:
3D Visibility Made Visibly Simple: An Introduction to the Visibility Skeleton. 475-476 - Mary Inaba, Hiroshi Imai, Motoki Nakade, Tatsurou Sekiguchi:
Application of an Effective Geometric Clustering Method to the Color Quantization Problem. 477-478 - Gill Barequet, Amy J. Briggs, Matthew Dickerson, Cristian Dima, Michael T. Goodrich:
Animating the Polygon-Offset Distance Function. 479-480 - Fausto Bernardini, Chandrajit L. Bajaj, Jindong Chen, Daniel Schikore:
A Triangulation-Based Object Reconstruction Method. 481-484 - Mark Lanthier, Anil Maheshwari, Jörg-Rüdiger Sack:
Approximating Weighted Shortest Paths on Polyhedral Surfaces. 485-486 - Subodh Kumar, Dinesh Manocha, William F. Garrett, Ming C. Lin:
Back-Face Computation of Polygon Clusters. 487-488
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-12-05 22:22 CET 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:
