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