default search action
5. CCCG 1993: Waterloo, Ontario, Canada
- Proceedings of the 5th Canadian Conference on Computational Geometry, Waterloo, Ontario, Canada, August 1993. University of Waterloo 1993
- Marc J. van Kreveld, Jack Snoeyink, Sue Whitesides:
Folding Rulers inside Triangles. CCCG 1993: 1-6 - Zhenyu Li, Victor Milenkovic:
The Complexity of the Compaction Problem. CCCG 1993: 7-11 - Lydia E. Kavraki, Jean-Claude Latombe, Randall H. Wilson:
On the Complexity of Assembly Partitioning. CCCG 1993: 12-17 - Jesus Garcia-Lopez, Pedro Ramos-Alonso:
Circular Visibility and Separability. CCCG 1993: 18-23 - Godfried T. Toussaint, Clark Verbrugge, Cao An Wang, Binhai Zhu:
Tetrahedralization of Simple and Non-Simple Polyhedra. CCCG 1993: 24-29 - Mary-Anne K. Posenau:
Approaches to High Aspect Ratio Triangulations. CCCG 1993: 30-35 - Scott A. Mitchell:
Approximating the Maxmin-angle Covering Triangulation. CCCG 1993: 36-41 - Maria-Cecilia Rivara:
A Discussion on the Triangulation Refinement Problem. CCCG 1993: 42-47 - William L. Steiger:
Algorithms for Ham Sandwich Cuts. CCCG 1993: 48-48 - Michael B. Dillencourt, David M. Mount, Alan Saalfeld:
On the Maximum Number of Intersections of Two Polyhedra in 2 and 3 Dimensions. CCCG 1993: 49-54 - Pankaj K. Agarwal, Micha Sharir:
On the Number of Views of Polyhedral Terrains. CCCG 1993: 55-60 - Jean-Marc Robert:
Geometric Orderings and Helly-type Theorem for Intersecting Translates in the Plane. CCCG 1993: 61-66 - Jacqueline D. Chang, Victor Milenkovic:
An Experiment Using LN for Exact Geometric Computations. CCCG 1993: 67-78 - David M. Mount, Nathan S. Netanyahu:
Efficient Algorithms for Robust Circular Arc Estimators. CCCG 1993: 79-84 - Svante Carlsson, Håkan Jonsson:
Guarding a Treasury. CCCG 1993: 85-90 - P. Pradeep Kumar, C. E. Veni Madhavan:
Shortest Watchman Tours in Weak Visibility Polygons. CCCG 1993: 91-96 - Bern-Cherng Liaw, N. F. Huang, Richard C. T. Lee:
The Minimum Cooperative Guards Problem on K-spiral Polygons. CCCG 1993: 97-102 - Shivakumar Viswanathan:
The Edge Guard Problem for Spiral Polygons. CCCG 1993: 103-108 - Mark de Berg, Marko de Groot, Mark H. Overmars:
Perfect Binary Space Partitions. CCCG 1993: 109-114 - Alon Efrat, Günter Rote, Micha Sharir:
On the Union of Fat Wedges and Separating a Collection of Segments By a Line. CCCG 1993: 115-120 - Viet Hai Nguyen, Thomas Roos, Peter Widmayer:
Balanced Cuts of a Set of Hyperrectangles. CCCG 1993: 121-126 - Leonidas J. Guibas, Dan Halperin, Jirí Matousek, Micha Sharir:
On Vertical Decomposition of Arrangements of Hyperplanes in Four Dimensions. CCCG 1993: 127-132 - Larry Shafer, William L. Steiger:
Randomizing Optimal Geometric Algorithms. CCCG 1993: 133-138 - Matthew J. Katz, Micha Sharir:
Optimal Slope Selection Via Expanders. CCCG 1993: 139-144 - William Rucklidge:
Lower Bounds for the Complexity of the Hausdorff Distance. CCCG 1993: 145-150 - L. Paul Chew, Michael T. Goodrich, Daniel P. Huttenlocher, Klara Kedem, Jon M. Kleinberg, Dina Kravets:
Geometric Pattern Matching Under Euclidean Motion. CCCG 1993: 151-156 - Jocelyn Cloutier, Imed Bennour:
Topological Characterization of Hwang's Optimal Steiner Trees. CCCG 1993: 157-162 - David G. Kirkpatrick, Jack Snoeyink:
Computing Constrained Shortest Segments: Butterfly Wingspans in Logarithmic Time. CCCG 1993: 163-168 - Asish Mukhopadhyay, Chanchal Kumar, Binay K. Bhattacharya:
Computing an Area-optimal Convex Polygonal Stabber of a Set of Parallel Line Segments. CCCG 1993: 169-174 - Pedro Jussieu de Rezende, Welson R. Jacometti:
GeoLab: An Environment for Development of Algorithms in Computational Geometry. CCCG 1993: 175-180 - Micha Sharir:
Arrangements of Surfaces in Higher Dimensions: Envelopes Single Cells and Other Recent Developments. CCCG 1993: 181-186 - Hossam A. ElGindy, Michael E. Houle, William J. Lenhart, Mirka Miller, David Rappaport, Sue Whitesides:
Dominance Drawings of Bipartite Graphs. CCCG 1993: 187-191 - Goos Kant, Giuseppe Liotta, Roberto Tamassia, Ioannis G. Tollis:
Area Requirement of Visibility Representations of Trees. CCCG 1993: 192-197 - Anna Lubiw, Nora Sleumer:
Maximal Outerplanar Graphs Are Relative Neighbourhood Graphs. CCCG 1993: 198-203 - Klara Kedem, Micha Sharir, Sivan Toledo:
On Critical Orientations in the Kedem-Sharir Motion Planning Algorithm for a Convex Polygon in the Plane. CCCG 1993: 204-209 - Mikhail J. Atallah, Danny Z. Chen:
On Parallel Rectilinear Obstacle-avoiding Paths. CCCG 1993: 210-215 - Erik L. Wynters, Joseph S. B. Mitchell:
Shortest Paths for a Two-robot Rendez-vous. CCCG 1993: 216-221 - Sven Schuierer, Derick Wood:
Generalized Kernels of Polygons with Holes. CCCG 1993: 222-227 - Ramasubramanian Venkatasubramanian, Akio Cullum:
Grazing inside a Convex Polygon. CCCG 1993: 228-233 - Ferran Hurtado:
Looking through a Window. CCCG 1993: 234-239 - Laxmi P. Gewali:
On Minimum and Maximum Visibility Problem. CCCG 1993: 240-245 - Mordecai J. Golin, Rajeev Raman, Christian Schwarz, Michiel H. M. Smid:
Simple Randomized Algorithms for Closest Pair Problems. CCCG 1993: 246-251 - Reuven Bar-Yehuda, Alon Efrat, Alon Itai:
A Simple Algorithm for Maintaining the Center of a Planar Point-set. CCCG 1993: 252-257 - Günter Rote, Christian Schwarz, Jack Snoeyink:
Maintaining the Approximate Width of a Set of Points in the Plane. CCCG 1993: 258-263 - Yossi Matias:
Semi-dynamic Closest-pair Algorithms. CCCG 1993: 264-271 - Raimund Seidel:
Teaching Computational Geometry. CCCG 1993: 272-272 - Tamal K. Dey:
Optimal Algorithms to Detect Null-homologous Cycles on 2-manifolds. CCCG 1993: 273-278 - Michela Bertolotto, Elisabetta Bruzzone, Leila De Floriani:
Acyclic Hierarchical Cell Complexes. CCCG 1993: 279-284 - Aldo Laurentini:
On the Minimal Number of Volume Intersection Operations Necessary for Reconstructing a 3D Object. CCCG 1993: 285-290 - A. James Stewart, Sherif Ghali:
An Output Sensitive Algorithm for the Computation of Shadow Boundaries. CCCG 1993: 291-296 - Derick Wood, Peter Yamamoto:
Dent and Staircase Visibility. CCCG 1993: 297-302 - Gautam Das, Paul J. Heffernan, Giri Narasimhan:
LR-visibility in Polygons. CCCG 1993: 303-308 - Hazel Everett, Anna Lubiw, Joseph O'Rourke:
Recovery of Convex Hulls From External Visibility Graphs. CCCG 1993: 309-314 - G. Srinivasaraghavan, Asish Mukhopadhyay:
On the Notion of Completeness for Reconstruction Algorithms on Visibility Graphs. CCCG 1993: 315-320 - Thomas C. Shermer:
The Continuous-graph Approach to Visibility Problems. CCCG 1993: 321-321 - Karen L. Daniels, Victor Milenkovic, Dan Roth:
Finding the Maximum Area Axis-parallel Rectangle in a Polygon. CCCG 1993: 322-327 - Ivan Stojmenovic:
Finding the Largest M-dimensional Circle in a K-dimensional Box. CCCG 1993: 328-333 - D. P. Wang, Richard C. T. Lee:
An Optimal Algorithm for Solving the Restricted Minimal Convex Nested Polygonal Separation Problem. CCCG 1993: 334-339 - Jean-Michel Moreau, Pascal Volino:
Constrained Delaunay Triangulation Revisited. CCCG 1993: 340-345 - Dominique Schmitt, Jean-Claude Spehner:
On Equiangularity of Delaunay Diagrams in Every Dimension. CCCG 1993: 346-351 - Timothy Lambert:
Systematic Local Flip Rules Are Generalized Delaunay Rules. CCCG 1993: 352-357 - Thomas Roos:
Tighter Bounds on Voronoi Diagrams of Moving Points. CCCG 1993: 358-363 - L. Paul Chew:
Near-quadratic Bounds for the ItL_1 Voronoi Diagram of Moving Points. CCCG 1993: 364-369 - Rolf Klein, Andrzej Lingas:
A Note on Generalizations of Chew's Algorithm for the Voronoi Diagram of a Convex Polygon. CCCG 1993: 370-374 - Ngoc-Minh Lê:
On General Properties of Strictly Convex Smooth Distance Functions in RD. CCCG 1993: 375-380 - Henk Meijer, Steven Skiena:
Reconstructing Polygons From X-Rays. CCCG 1993: 381-386 - Esther M. Arkin, Patrice Belleville, Joseph S. B. Mitchell, David M. Mount, Kathleen Romanik, Steven Salzberg, Diane L. Souvaine:
Testing Simple Polygons. CCCG 1993: 387-392 - Jurek Czyzowicz, Eduardo Rivera-Campo, Jorge Urrutia:
Optimal Floodlight Illumination of Stages. CCCG 1993: 393-398 - Prosenjit Bose, Leonidas J. Guibas, Anna Lubiw, Mark H. Overmars, Diane L. Souvaine, Jorge Urrutia:
The Floodlight Problem. CCCG 1993: 399-404 - Chee Yap:
Low Level Issues in Computational Geometry. CCCG 1993: 405-419 - Klaus H. Hinrichs, Thorsten Graf:
Algorithms for Proximity Problems on Colored Point Sets. CCCG 1993: 420-425 - Ravi Janardan, Franco P. Preparata:
Widest-corridor Problems. CCCG 1993: 426-431 - Alon Efrat, Micha Lindenbaum, Micha Sharir:
Finding Maximally Consistent Sets of Halfspaces. CCCG 1993: 432-436 - Michael McAllister, Jack Snoeyink:
Two-dimensional Computation of the Three-dimensional Reachable Region for a Welding Head. CCCG 1993: 437-442 - Christian Icking, Rolf Klein, Lihong Ma:
How to Look Around a Corner. CCCG 1993: 443-448 - Abhi Dattasharma, S. Sathiya Keerthi:
Translational Motion Planning for a Convex Polyhedron in a 3D Polyhedral World Using an Efficient and New Roadmap. CCCG 1993: 449-454 - Gunter Bär, Claudia Iturriaga:
Rectangle Packing in Polynomial Time. CCCG 1993: 455-460 - Esther M. Arkin, Sándor P. Fekete, Joseph S. B. Mitchell:
The Lawnmower Problem. CCCG 1993: 461-466 - Patrice Belleville:
On Restricted Boundary Covers and Convex Three-Covers. CCCG 1993: 467-472 - Victor Milenkovic:
Robust Construction of the Voronoi Diagram of a Polyhedron. CCCG 1993: 473-478 - C. Bradford Barber, Michael D. Hirsch:
A Robust Algorithm for Point in Polyhedron. CCCG 1993: 479-484 - Victor Milenkovic, Veljko Milenkovic:
Rational Orthogonal Approximations to Orthogonal Matrices. CCCG 1993: 485-490
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 2024-10-31 20:03 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: