This list is also available as a
BibTeX
file.
Full proceedings in PDF
-
- 1
-
Joseph O'Rourke.
Vertex pi-lights for monotone mountains.
In Proceedings of the 9th Canadian Conference on Computational
Geometry (CCCG'97), 1997.
- 2
-
Mark Babikov, Diane Souvaine, and Rephael Wenger.
Constructing piecewise linear homeomorphisms of polygons with holes.
In Proceedings of the 9th Canadian Conference on Computational
Geometry (CCCG'97), 1997.
- 3
-
Naixun Pei and Sue Whitesides.
On folding rulers in regular polygons.
In Proceedings of the 9th Canadian Conference on Computational
Geometry (CCCG'97), 1997.
- 4
-
Jorge Urrutia.
On the number of internal and external visibility edges of polygons.
In Proceedings of the 9th Canadian Conference on Computational
Geometry (CCCG'97), 1997.
- 5
-
Masatsugu Urabe.
On a partition of point sets into convex polygons.
In Proceedings of the 9th Canadian Conference on Computational
Geometry (CCCG'97), 1997.
- 6
-
Jurek Czyzowicz, Evangelos Kranakis, and Jorge Urrutia.
Domino tilings and two-by-two squares.
In Proceedings of the 9th Canadian Conference on Computational
Geometry (CCCG'97), 1997.
- 7
-
Sergei Bespamyatnikh and Michael Segal.
Covering a set of points by two axis-parallel boxes.
In Proceedings of the 9th Canadian Conference on Computational
Geometry (CCCG'97), 1997.
- 8
-
Markus Denny and Christian Sohler.
Encoding a triangulation as a permutation of its point set.
In Proceedings of the 9th Canadian Conference on Computational
Geometry (CCCG'97), 1997.
- 9
-
Eduardo Rivera-Campo and Virginia Urrutia-Galicia.
A note on the tree graph of a set of points in the plane.
In Proceedings of the 9th Canadian Conference on Computational
Geometry (CCCG'97), 1997.
- 10
-
M. Kano.
A straight-line embedding of two or more rooted trees in the plane.
In Proceedings of the 9th Canadian Conference on Computational
Geometry (CCCG'97), 1997.
- 11
-
Atsushi Kaneko.
A balanced partition of points in the plane and tree embedding
problems.
In Proceedings of the 9th Canadian Conference on Computational
Geometry (CCCG'97), 1997.
- 12
-
Mikhail J. Atallah, Danny Z. Chen, and Kevin S. Klenk.
Parallel algorithms for longest increasing chains in the plane and
related problems.
In Proceedings of the 9th Canadian Conference on Computational
Geometry (CCCG'97), 1997.
- 13
-
Hazel Everett, Chinh Hoang, Kyri Kilakos, and Marc Noy.
Planar segment visibility graphs.
In Proceedings of the 9th Canadian Conference on Computational
Geometry (CCCG'97), 1997.
- 14
-
Gautam Das.
The visibility graph contains a bounded-degree spanner.
In Proceedings of the 9th Canadian Conference on Computational
Geometry (CCCG'97), 1997.
- 15
-
L. Gewali, J. Bagga, S. Dey, and J. Emert J. McGrew.
Contracted visibility graphs of line segments.
In Proceedings of the 9th Canadian Conference on Computational
Geometry (CCCG'97), 1997.
- 16
-
Kiyoshi Hosono and Katsumi Matsuda.
Geometric matching problem of disjoint compact convex sets by line
segments.
In Proceedings of the 9th Canadian Conference on Computational
Geometry (CCCG'97), 1997.
- 17
-
Francois Rebufat.
Handling rotations in the placement of curved convex polygons.
In Proceedings of the 9th Canadian Conference on Computational
Geometry (CCCG'97), 1997.
- 18
-
Evangelos Kranakis and Anthony Spatharis.
Almost optimal on-line search in unknown streets.
In Proceedings of the 9th Canadian Conference on Computational
Geometry (CCCG'97), 1997.
- 19
-
Subir K. Ghosh and Joel W. Burdick.
An on-line algorithm for exploring an unknown polygonal environment
by a point robot.
In Proceedings of the 9th Canadian Conference on Computational
Geometry (CCCG'97), 1997.
- 20
-
Subir K. Ghosh and Joel W. Burdick.
Understanding discrete visibility and related approximation
algorithms.
In Proceedings of the 9th Canadian Conference on Computational
Geometry (CCCG'97), 1997.
- 21
-
Ngoc-Minh Le.
Jin akiyama.
In Proceedings of the 9th Canadian Conference on Computational
Geometry (CCCG'97), 1997.
- 22
-
Toshiyuki Imai.
Some methods to determine the sign of a long integer from its
remainders.
In Proceedings of the 9th Canadian Conference on Computational
Geometry (CCCG'97), 1997.
- 23
-
Michelucci Dominique.
A quadratic non-standard arthmetic.
In Proceedings of the 9th Canadian Conference on Computational
Geometry (CCCG'97), 1997.
- 24
-
Christophe LEMAIRE and 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.
In Proceedings of the 9th Canadian Conference on Computational
Geometry (CCCG'97), 1997.
- 25
-
Sven Schuierer.
16:45</td><td>business meeting.
In Proceedings of the 9th Canadian Conference on Computational
Geometry (CCCG'97), 1997.
- 26
-
Binay Bhattacharya.
Biased search and k-point clustering.
In Proceedings of the 9th Canadian Conference on Computational
Geometry (CCCG'97), 1997.
- 27
-
Stéphane Rivière.
Walking in the visibility complex with applications to visibility
polygons and dynamic visibility.
In Proceedings of the 9th Canadian Conference on Computational
Geometry (CCCG'97), 1997.
- 28
-
Frédo Dur, George Drettakis, and Claude Puech.
The 3d visibility complex: a unified data-structure for global
visibility of scenes of polygons and smooth objects.
In Proceedings of the 9th Canadian Conference on Computational
Geometry (CCCG'97), 1997.
- 29
-
F. Javier Cobos, J. Carlos Dana, Clara I. Grima, and Alberto Marquez.
The width of a convex set on the sphere.
In Proceedings of the 9th Canadian Conference on Computational
Geometry (CCCG'97), 1997.
- 30
-
F. Javier Cobos, J. Carlos Dana, Clara I. Grima, and Alberto Marquez.
Diameter of a set on the cylinder.
In Proceedings of the 9th Canadian Conference on Computational
Geometry (CCCG'97), 1997.
- 31
-
Artur Fuhrmann.
Testing roundness of a polytope and related problems.
In Proceedings of the 9th Canadian Conference on Computational
Geometry (CCCG'97), 1997.
- 32
-
Sergey Tarasov.
On hardness of roundness calculation.
In Proceedings of the 9th Canadian Conference on Computational
Geometry (CCCG'97), 1997.
- 33
-
Göktürk Ücoluk and I. Hakki Toroslu.
</td><td><em>eugene fiume</em>.
In Proceedings of the 9th Canadian Conference on Computational
Geometry (CCCG'97), 1997.
- 34
-
Fausto Bernardini and Chrajit L. Bajaj.
Sampling and reconstructing manifolds using alpha-shapes.
In Proceedings of the 9th Canadian Conference on Computational
Geometry (CCCG'97), 1997.
- 35
-
Fabrice Jaillet, Behzad Shariat, and Denis Vorpe.
Periodic b-spline surface skinning of anatomic shapes.
In Proceedings of the 9th Canadian Conference on Computational
Geometry (CCCG'97), 1997.
- 36
-
Serge Pontier, Behzad Shariat, and Denis Vorpe.
Shape reconstruction using skeleton-based implicit surface.
In Proceedings of the 9th Canadian Conference on Computational
Geometry (CCCG'97), 1997.
- 37
-
Michael G. Lamoureux, Joseph D. Horton, and Bradford G. Nickerson.
Dynamizing domination queries in 2-dimensions: The paper stabbing
problem revisited.
In Proceedings of the 9th Canadian Conference on Computational
Geometry (CCCG'97), 1997.
- 38
-
Christos Makris and Athanasios Tsakalidis.
Fast piercing of iso-oriented rectangles.
In Proceedings of the 9th Canadian Conference on Computational
Geometry (CCCG'97), 1997.
- 39
-
Cao An Wang and Binhai Zhu.
Shooter location problems revisited.
In Proceedings of the 9th Canadian Conference on Computational
Geometry (CCCG'97), 1997.
- 40
-
Pankaj K. Agarwal, Mark van Kreveld, Subhash Suri, and Joseph Mitchell.
Label placement by maximum independent set in rectangles.
In Proceedings of the 9th Canadian Conference on Computational
Geometry (CCCG'97), 1997.
- 41
-
Bettina Speckmann and Jack Snoeyink.
Easy triangle strips for tin terrain models.
In Proceedings of the 9th Canadian Conference on Computational
Geometry (CCCG'97), 1997.
- 42
-
Cavit Aydin and Doug Ierardi.
Partitioning algorithms for transportation graphs and their
applications to routing.
In Proceedings of the 9th Canadian Conference on Computational
Geometry (CCCG'97), 1997.
- 43
-
Frank Weller.
Stability of voronoi neighborship under perturbations of the sites.
In Proceedings of the 9th Canadian Conference on Computational
Geometry (CCCG'97), 1997.
- 44
-
Francois Anton and Christopher Gold.
An iterative algorithm for the determination of voronoi vertices in
polygonal and non-polygonal domains.
In Proceedings of the 9th Canadian Conference on Computational
Geometry (CCCG'97), 1997.
- 45
-
Carsten Dorgerloh, Jens Luessem, Morakot Pilouk, and Juergen Wirtgen.
Some tools for modeling and analysis of surfaces.
In Proceedings of the 9th Canadian Conference on Computational
Geometry (CCCG'97), 1997.
- 46
-
Bruno Adam, Pierre Kauffmann, Dominique Schmitt, and Jean-Claude Spehner.
An increasing-circle sweep-algorithm to construct the delaunay
diagram in the plane.
In Proceedings of the 9th Canadian Conference on Computational
Geometry (CCCG'97), 1997.
CCCG Website
2009-11-16