9. CCCG 1997:
Kingston,
Ontario,
Canada
Proceedings of the 9th Canadian Conference on Computational Geometry,
Kingston,
Ontario,
Canada,
August 11-14,
1997
- Joseph O'Rourke:
Vertex pi-lights for monotone mountains.
- Mark Babikov, Diane L. Souvaine, Rephael Wenger:
Constructing piecewise linear homeomorphisms of polygons with holes.
- Naixun Pei, Sue Whitesides:
On folding rulers in regular polygons.
- Jorge Urrutia:
On the number of internal and external visibility edges of polygons.
- Masatsugu Urabe:
On a partition of point sets into convex polygons.
- Jurek Czyzowicz, Evangelos Kranakis, Jorge Urrutia:
Domino tilings and two-by-two squares.
- Sergei Bespamyatnikh, Michael Segal:
Covering a set of points by two axis-parallel boxes.
- Markus Denny, Christian Sohler:
Encoding a triangulation as a permutation of its point set.
- Eduardo Rivera-Campo, Virginia Urrutia-Galicia:
A note on the tree graph of a set of points in the plane.
- M. Kano:
A straight-line embedding of two or more rooted trees in the plane.
- Atsushi Kaneko:
A balanced partition of points in the plane and tree embedding problems.
- Mikhail J. Atallah, Danny Z. Chen, Kevin S. Klenk:
Parallel algorithms for longest increasing chains in the plane and related problems.
- Hazel Everett, Chính T. Hoàng, Kyriakos Kilakos, Marc Noy:
Planar segment visibility graphs.
- Gautam Das:
The visibility graph contains a bounded-degree spanner.
- Laxmi Gewali, Jay Bagga, S. Dey, J. Emert, J. McGrew:
Contracted visibility graphs of line segments.
- Kiyoshi Hosono, Katsumi Matsuda:
Geometric matching problem of disjoint compact convex sets by line segments.
- Francois Rebufat:
Handling rotations in the placement of curved convex polygons.
- Evangelos Kranakis, Anthony Spatharis:
Almost optimal on-line search in unknown streets.
- Subir Kumar Ghosh, Joel W. Burdick:
An on-line algorithm for exploring an unknown polygonal environment by a point robot.
- Subir Kumar Ghosh, Joel W. Burdick:
Understanding discrete visibility and related approximation algorithms.
- Ngoc-Minh Lê:
Jin akiyama.
- Toshiyuki Imai:
Some methods to determine the sign of a long integer from its remainders.
- Dominique Michelucci:
A quadratic non-standard arthmetic.
- Christophe Lemaire, Jean-Michel Moreau:
Analysis of a class of k-dimensional merge procedures, with an application to 2d delaunay triangulation in expected linear time after two-directional sorting.
- Binay K. Bhattacharya:
Biased search and k-point clustering.
- Stéphane Rivière:
Walking in the visibility complex with applications to visibility polygons and dynamic visibility.
- Frédo Durand, George Drettakis, Claude Puech:
The 3d visibility complex: a unified data-structure for global visibility of scenes of polygons and smooth objects.
- Francisco Javier Cobos, Juan Carlos Dana, Clara I. Grima, Alberto Márquez:
The width of a convex set on the sphere.
- Francisco Javier Cobos, Juan Carlos Dana, Clara I. Grima, Alberto Márquez:
Diameter of a set on the cylinder.
- Artur Fuhrmann:
Testing roundness of a polytope and related problems.
- Sergey P. Tarasov:
On hardness of roundness calculation.
- Göktürk Üçoluk, Ismail Hakki Toroslu:
Reconstruction of 3-D surface object from its pieces.
- Fausto Bernardini, Chandrajit L. Bajaj:
Sampling and reconstructing manifolds using alpha-shapes.
- Fabrice Jaillet, Behzad Shariat, Denis Vorpe:
Periodic b-spline surface skinning of anatomic shapes.
- Serge Pontier, Behzad Shariat, Denis Vorpe:
Shape reconstruction using skeleton-based implicit surface.
- Michael G. Lamoureux, Joseph Douglas Horton, Bradford G. Nickerson:
Dynamizing domination queries in 2-dimensions: The paper stabbing problem revisited.
- Christos Makris, Athanasios K. Tsakalidis:
Fast piercing of iso-oriented rectangles.
- Cao An Wang, Binhai Zhu:
Shooter location problems revisited.
- Pankaj K. Agarwal, Marc J. van Kreveld, Subhash Suri:
Label placement by maximum independent set in rectangles.
- Bettina Speckmann, Jack Snoeyink:
Easy triangle strips for tin terrain models.
- Cavit Aydin, Doug Ierardi:
Partitioning algorithms for transportation graphs and their applications to routing.
- Frank Weller:
Stability of voronoi neighborship under perturbations of the sites.
- Francois Anton, Christopher M. Gold:
An iterative algorithm for the determination of voronoi vertices in polygonal and non-polygonal domains.
- Carsten Dorgerloh, Jens Luessem, Morakot Pilouk, Juergen Wirtgen:
Some tools for modeling and analysis of surfaces.
- Bruno Adam, Pierre Kauffmann, Dominique Schmitt, Jean-Claude Spehner:
An increasing-circle sweep-algorithm to construct the delaunay diagram in the plane.
Last update Tue May 22 23:23:23 2012
CET by the DBLP Team — 
Data released under the ODC-BY 1.0 license — See also our legal information page
