default search action
6. CCCG 1994: Saskatoon, Saskatchewan, Canada
- Proceedings of the 6th Canadian Conference on Computational Geometry, Saskatoon, SK, Canada, August 1994. University of Saskatchewan 1994
Arrangements I
- Tetsuo Asano, Takeshi Tokuyama:
Topological Walk Revisited. CCCG 1994: 1-6 - William L. Steiger, Ileana Streinu:
A Pseudo-Algorithmic Separation of Lines from Pseudo-Lines. CCCG 1994: 7-11 - Mary Inaba, Yasukazu Aoki, Susumu Hasegawa:
Level Difference of the Reconstructed Arrangement. CCCG 1994: 12-17
Visibility Graphs
- Anna Lubiw, Naji Mouawad:
Interval Graphs as Visibility Graphs of Simple Polygons Part 1: Parachutes. CCCG 1994: 18-23 - Michel Pocchiola, Gert Vegter:
Minimal Tangent Visibility Graphs. CCCG 1994: 24-29 - Shiou-Yi Lin, Chiuyuan Chen:
Planar Visibility Graphs. CCCG 1994: 30-35 - Herbert Edelsbrunner:
Modeling with Simplicial Complexes. CCCG 1994: 36-44
Motion Planning
- Vincenzo Ferrucci, Mark H. Overmars, Anil S. Rao, Jules Vleugels:
Hunting Voronoi Vertices in Non-Polygonal Domains. CCCG 1994: 45-50 - Chantal Wentink, Otfried Schwarzkopf:
Motion Planning for Vacuum Cleaner Robots. CCCG 1994: 51-56 - Siu-Wing Cheng:
Widest Empty Corridor with Multiple Links and Right-angle Turns. CCCG 1994: 57-62
Nearest Neighbours
- Andreas Brinkman, Thorsten Graf, Klaus H. Hinrichs:
The Colored Quadrant Priority Search Tree with an Application to the all-nearest-foreign-neighbors Problem. CCCG 1994: 63-68 - Thorsten Graf, Klaus H. Hinrichs:
Distribution Algorithms for the all-nearest-foreign-neighbors Problem in Arbitrary Lt-metrics. CCCG 1994: 69-74 - Sergei Bespamyatnikh:
The Region Approach for some Dynamic Closest-Point Problems. CCCG 1994: 75-80
Illumination
- Vladimir Estivill-Castro, Jorge Urrutia:
Optimal Floodlight Illumination of Orthogonal Art Galleries. CCCG 1994: 81-86 - William L. Steiger, Ileana Streinu:
Positive and Negative Results on the Floodlight Problem. CCCG 1994: 87-92
Arrangements II
- Chuzo Iwamoto, Godfried T. Toussaint:
Finding Hamiltonian Circuits in Arrangements of Jordan Curves is NP-complete. CCCG 1994: 93-98 - Hervé Brönnimann, Bernard Chazelle:
Optimal Slope Selection Via Cuttings. CCCG 1994: 99-103
Paths in a Polygon
- John Hershberger, Jack Snoeyink:
An Efficient Solution to the Zookeeper's Problem. CCCG 1994: 104-109 - Evanthia Papadopoulou, D. T. Lee:
Shortest Paths in a Simple Polygon in the Presence of Forbidden Vertices. CCCG 1994: 110-115 - Peter Yamamoto:
Computing the Dent Diameter of a Polygon. CCCG 1994: 116-121
Voronoi Diagrams
- Olivier Devillers, Mordecai J. Golin, Klara Kedem, Stefan Schirra:
Revenge of the Dog: Queries on Voronoi Diagrams of Moving Points. CCCG 1994: 122-127 - Martin Held:
On Computing Voronoi Diagrams of Convex Polyhedra by Means of Wavefront Propagation. CCCG 1994: 128-133 - Abhi Dattasharma:
Some Qualitative Properties of a Generalized Voronoi Diagram for Convex Polyhedra in d-dimensions. CCCG 1994: 134-139
Geometric Graphs
- Srinivasa Rao Arikati, Anil Maheshwari, Christos D. Zaroliagis:
Saving Bits Made Easy. CCCG 1994: 140-146 - Timothy Law Snyder, J. Michael Steele:
Worst-Case TSP Point Sets in All Dimensions are Asymptotically Equidistributed. CCCG 1994: 147-152
Convex Hulls
- Olivier Devillers, Mordecai J. Golin:
Incremental Algorithms for Finding the Convex Hulls of Circles and the Lower Envelopes of Parabolas. CCCG 1994: 153-158 - Tsuyoshi Ono:
An Eight-Way Perturbation Technique for the Three-Dimensional Convex Hull. CCCG 1994: 159-164
Delauny Triangulations I
- Jean-Michel Moreau:
Hierarchical Delaunay Triangulation. CCCG 1994: 165-170 - Hiroshi Inagaki, Kokichi Sugihara:
Numerically Robust Algorithm for Contructing Constrained Delaunay Triangulation. CCCG 1994: 171-176 - Andreas Voigtmann, Ludger Becker, Klaus H. Hinrichs:
The Contrained Delaunay Pyramid - A Model for Reconstructing Surfaces at Multiple Resolutions. CCCG 1994: 177-182
Polygons
- Laxmi P. Gewali:
Recognizing S-Star Polygons. CCCG 1994: 183-188 - Chong Zhu, Gopalakrishnan Sundaram, Jack Snoeyink, Joseph S. B. Mitchell:
Generating Random x-Monotone Polygons with Given Vertices. CCCG 1994: 189-194
Delauny Triangulations II
- Francisco Santos:
On Delaunay oriented Matroids. CCCG 1994: 195-200 - Timothy Lambert:
The Delaunay Triangulation Maximizes the Mean Inradius. CCCG 1994: 201-206
Optical Model
- Y. B. Karasik:
Optical Computer Vision. CCCG 1994: 207-211 - Y. B. Karasik:
Constructing Optically in Constant Time the K-Level of an Arrangement of Lines in the Plane and Other Related Problems. CCCG 1994: 212-218
Applications
- Christopher M. Gold:
Persistent Spatial Relations - a Systems Design Objective. CCCG 1994: 219-224 - Karen L. Daniels, Victor Milenkovic:
Limited Gaps. CCCG 1994: 225-230 - Paul G. Mezey:
The T-Hull Approach to Shape Analysis. CCCG 1994: 231-236
Implementation
- Peter Hertling, Klaus Weihrauch:
Levels of Degeneracy and Exact Lower Complexity Bounds for Geometric Algorithms. CCCG 1994: 237-242 - David P. Dobkin, Ayellet Tal:
GASP - An Animation System for Computational Geometry. CCCG 1994: 243-249 - Manuel Abellanas, Ferran Hurtado, Pedro A. Ramos:
Tolerance of Geometric Structures. CCCG 1994: 250-255
Intersection
- Binhai Zhu:
Intersection Detection and Computation of Manhattan Terrains. CCCG 1994: 256-262 - Timothy M. Chan:
A Simple Trapezoid Sweep Algorithm for Reporting Red/Blue Segment Intersections. CCCG 1994: 263-268 - Paul Colley, Henk Meijer, David Rappaport:
Optimal Nearly-Similar Polygon Stabbers of Convex Polygons. CCCG 1994: 269-274
Graphs
- Ryan Hayward, Paul E. Kearney:
Tolerance-Free NeST Representations. CCCG 1994: 275-280 - Giuseppe Liotta, Francesco Vargiu, Giuseppe Di Battista:
Orthogonal Drawings with the Minimum Number of Bends. CCCG 1994: 281-286 - Michael B. Dillencourt, Warren D. Smith:
Graph-Theoretical Conditions for Inscribability and Delaunay Realizability. CCCG 1994: 287-292
Guard Problems I
- Hazel Everett, Eduardo Rivera-Campo:
Edge Guarding a Triangulated Polyhedral Terrain. CCCG 1994: 293-295 - Siu-Ming Yiu, A. Choi:
Edge Guards on a Fortress. CCCG 1994: 296-301 - Ervin Györi, Frank Hoffmann, Klaus Kriegel, Thomas C. Shermer:
Generalized Guarding and Partitioning for Rectilinear Polygons. CCCG 1994: 302-307
Optimization
- Joseph L. Ganley, James P. Cohoon:
Optimal Rectilinear Steiner Minimal Trees in O (n22.62n) Time. CCCG 1994: 308-313 - Claudio Mirolo:
Convex Minimization on a Grid and Applications. CCCG 1994: 314-319 - Leonidas Palios:
On the Number of Extrema of a Polyhedron. CCCG 1994: 320-325
Triangulations
- Scott A. Mitchell:
Cardinality Bounds for Triangulations with Bounded Minimum Angle. CCCG 1994: 326-331 - Cao An Wang:
An Optimal Algorithm for Greedy Triangulation of a Set of Points. CCCG 1994: 332-338 - Tamal K. Dey, Michael B. Dillencourt, Subir Kumar Ghosh:
Triangulating with High Connectivity. CCCG 1994: 339-343
Polyhedra
- Prosenjit Bose, David Bremner, Godfried T. Toussaint:
All Convex Polyhedra can be Clamped with Parallel Jaw Grippers. CCCG 1994: 344-349 - Leonidas Palios:
Optimal Tetrahedralization of the 3d-Region between a Convex Polyhedron and a Convex Polygon. CCCG 1994: 350-356 - Abhi Dattasharma:
The Size of a Generalized Voronoi Diagram for Convex Polyhedra in d-dimensions. CCCG 1994: 357-362
Visibility
- David Bremner:
Link-2-Convex One-Fillable Polygons are Starshaped. CCCG 1994: 363-368 - Stephen K. Wismath:
Reconstruction of Parallel Line Segments From Endpoint Visibility Information. CCCG 1994: 369-374 - Danny Z. Chen:
Determining Weak External Visibility of Polygons in Parallel. CCCG 1994: 375-380
Guard Problems II
- Patrice Belleville, Prosenjit Bose, Jurek Czyzowicz, Jorge Urrutia, Joseph Zaks:
K-Guarding Polygons on the Plane. CCCG 1994: 381-386 - Gregorio Hernández-Peñalver:
Controlling Guards. CCCG 1994: 387-392 - Manuel Abellanas, Jesus Garcia-Lopez, Ferran Hurtado:
Consecutive Guards. CCCG 1994: 393-398
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-01-16 22:19 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: