10. CCCG 1998: Montréal, Québec, Canada

Proceedings of the 10th Canadian Conference on Computational Geometry, McGill University, Montréal, Québec, Canada, August 10-12, 1998

Bruno Adam, Pierre Kauffmann, Dominique Schmitt, Jean-Claude Spehner:
A shrinking-circle sweep-algorithm to construct the farthest site delaunay diagram in the plane.
Electronic Edition (link) BibTeX
Jin Akiyama, Gisaku Nakamura, Eduardo Rivera-Campo, Jorge Urrutia:
Perfect divisions of a cake.
Electronic Edition (link) BibTeX
Lyudmil Aleksandrov, Hristo Djidjev:
Maintaining partitions of dynamic planar meshes.
Electronic Edition (link) BibTeX
Pierre Alliez, Olivier Devillers, Jack Snoeyink:
Removing degeneracies by perturbing the problem or perturbing the world.
Electronic Edition (link) BibTeX
Francois Anton, Darka Mioc, Christopher M. Gold:
Dynamic additively weighted voronoi diagrams made easy.
Electronic Edition (link) BibTeX
Chandrajit L. Bajaj, Valerio Pascucci, Robert J. Holt, Arun N. Netravali:
Dynamic maintenance and visualization of molecular surfaces.
Electronic Edition (link) BibTeX
Mark de Berg, Prosenjit Bose, David Bremner, William S. Evans, Lata Narayanan:
Recovering lines with fixed linear probes.
Electronic Edition (link) BibTeX
Joy Bhadury, Ramaswamy Chandrasekaran, Laxmi Gewali:
Constructing median constrained minimum spanning tree.
Electronic Edition (link) BibTeX
Binay K. Bhattacharya, Subir Kumar Ghosh:
Characterizing lr-visibility polygons and related problems.
Electronic Edition (link) BibTeX
Therese C. Biedl, Erik D. Demaine, Martin L. Demaine, Sylvain Lazard, Anna Lubiw, Joseph O'Rourke, Steve Robbins, Ileana Streinu, Godfried T. Toussaint, Sue Whitesides:
On reconfiguring tree linkages: Trees can lock.
Electronic Edition (link) BibTeX
Therese C. Biedl, Erik D. Demaine, Martin L. Demaine, Anna Lubiw, Godfried T. Toussaint:
Hiding disks in folded polygons.
Electronic Edition (link) BibTeX
Therese C. Biedl, Erik D. Demaine, Martin L. Demaine, Anna Lubiw, Mark H. Overmars, Joseph O'Rourke, Steve Robbins, Sue Whitesides:
Unfolding some classes of orthogonal polyhedra.
Electronic Edition (link) BibTeX
Daciana Bochis, Francisco Santos:
Towards a realistic upper bound for the number of facets of 3-dimensional dirichlet stereohedr.
Electronic Edition (link) BibTeX
Prosenjit Bose, Ferran Hurtado, Henk Meijer, Suneeta Ramaswami, David Rappaport, Vera Sacristan, Thomas C. Shermer, Godfried T. Toussaint:
Finding specified sections of arrangements: 2d results.
Electronic Edition (link) BibTeX
Prosenjit Bose, Jean-Denis Caron, Kilani Ghoudi:
Detection of text-line orientation.
Electronic Edition (link) BibTeX
Prosenjit Bose, Jurek Czyzowicz, Dominic Lessard:
Cutting rectangles in equal area pieces.
Electronic Edition (link) BibTeX
Danny Z. Chen, Jinhui Xu:
An efficient direct approach for computing shortest rectilinear paths among obstacles in a two-layer interconnection model.
Electronic Edition (link) BibTeX
Paolo Cignoni, Leila De Floriani:
Power diagram depth sorting.
Electronic Edition (link) BibTeX
Felipe Contreras, Jurek Czyzowicz, Nicolas Fraiji, Jorge Urrutia:
Illuminating triangles and quadrilaterals with vertex floodlights.
Electronic Edition (link) BibTeX
Jurek Czyzowicz, F. Contreras-Alcalá, Jorge Urrutia:
On measuring areas of polygons.
Electronic Edition (link) BibTeX
José Miguel Díaz-Báñez, Francisco Gómez, Ferran Hurtado:
Some problems on approximation of set of points by polygonal curves.
Electronic Edition (link) BibTeX
Adrian Dumitrescu:
Planar sets with few empty convex polygons.
Electronic Edition (link) BibTeX
Stephan Eidenbenz, Christoph Stamm, Peter Widmayer:
Inapproximability of some art gallery problems.
Electronic Edition (link) BibTeX
Regina Estkowski:
No steiner point subdivision simplification is NP-complete.
Electronic Edition (link) BibTeX
Hazel Everett, Sylvain Lazard, Steven M. Robbins, H. Schröder, Sue Whitesides:
Convexifying star-shaped polygons.
Electronic Edition (link) BibTeX
Francisco Gómez, Ferran Hurtado, Joan Antoni Sellarès, Godfried T. Toussaint:
Perspective projections and removal of degeneracies.
Electronic Edition (link) BibTeX
Jesus Garcia-Lopez, Pedro A. Ramos:
Shortest paths and visibility inside triangulated curved polygons with applications to conic visibility.
Electronic Edition (link) BibTeX
Mohammad Ghodsi, Jörg-Rüdiger Sack:
A coarse grained parallel solution to terrain simplification.
Electronic Edition (link) BibTeX
André Guéziec, Gabriel Taubin:
A framework for memory-efficient levels of detail.
Electronic Edition (link) BibTeX
Leonidas J. Guibas, Li Zhang:
Euclidean proximity and power diagrams.
Electronic Edition (link) BibTeX
M. Carmen Hernando, Ferran Hurtado, Alberto Márquez, Mercè Mora, Marc Noy:
Geometric tree graphs of points in the plane.
Electronic Edition (link) BibTeX
Kiyoshi Hosono, Masatsugu Urabe:
On a disjoint quadrilateral partition for a given point se.
Electronic Edition (link) BibTeX
Ernst Huber:
Intersecting general parametric surfaces using bounding volumes.
Electronic Edition (link) BibTeX
Ferran Hurtado, Marc Noy, Pedro A. Ramos, Carlos Seara:
Separating objects in the plane with wedges and strips.
Electronic Edition (link) BibTeX
Ferran Hurtado, Marc Noy, Jorge Urrutia:
Parallel edge flipping.
Electronic Edition (link) BibTeX
Ferran Hurtado, Vera Sacristan, Godfried T. Toussaint:
Constrainted facility location.
Electronic Edition (link) BibTeX
Mary Inaba, Hiroshi Imai:
Geometric clustering models for multimedia databases.
Electronic Edition (link) BibTeX
Konstantinos G. Kakoulis, Ioannis G. Tollis:
On the multiple label placement problem.
Electronic Edition (link) BibTeX
Atsushi Kaneko, Mikio Kano:
Balanced partitions of two sets of points in the plane.
Electronic Edition (link) BibTeX
Atsushi Kaneko, Mikio Kano, Shin-ichi Tokunaga:
Straight-line embeddings of three rooted trees in the plane.
Electronic Edition (link) BibTeX
J. Mark Keil, Jack Snoeyink:
On the time bound for convex decomposition of simple polygons.
Electronic Edition (link) BibTeX
Alejandro López-Ortiz, Sven Schuierer:
The exact cost of exploring streets with a cab.
Electronic Edition (link) BibTeX
Andrzej Lingas:
Subexponential-time algorithms for minimum weight triangulations and related problems.
Electronic Edition (link) BibTeX
Giuseppe Liotta:
A note on checking proximity graphs.
Electronic Edition (link) BibTeX
Bor-Kuan Lu, Fang-Rong Hsu, Chuan Yi Tang:
Guarding in a simple polygon.
Electronic Edition (link) BibTeX
David M. Mount, Nathan S. Netanyahu, Christine D. Piatko, Ruth Silverman, Angela Y. Wu:
Quantile approximation for robust statistical estimation.
Electronic Edition (link) BibTeX
Frank Nielsen:
On point covers of c-oriented polygons.
Electronic Edition (link) BibTeX
Antonio A. F. Oliveira, Luiz M. G. Gonçalves, Claudio Esperança:
Towards a contour morphing preserving differentiability.
Electronic Edition (link) BibTeX
Elsa Omaña-Pulido, Godfried T. Toussaint:
Aperture-angle optimization problems in 3 dimensions.
Electronic Edition (link) BibTeX
Kensuke Onishi, Hiroshi Imai:
Riemannian computational geometry: Voronoi diagram delaunay-type triangulation in dually flat space.
Electronic Edition (link) BibTeX
Paolo Penna, Paola Vocca:
Proximity drawings of binary trees in polynomial area.
Electronic Edition (link) BibTeX
Markus Schneider, Ralf Hartmut Güting, Thomas de Ridder:
Computational geometry on the grid: Transversal and planesweep algorithms for spatial applications.
Electronic Edition (link) BibTeX
Michael A. Soss:
The size of the open sphere of influence graph in metric spaces.
Electronic Edition (link) BibTeX
Christoph Stamm, Stephan Eidenbenz, Renato Pajarola:
A modified longest side bisection triangulation.
Electronic Edition (link) BibTeX
William L. Steiger, Rephael Wenger:
Hyperplane depth and nested simplices.
Electronic Edition (link) BibTeX
Akira Tajima, Hiroshi Imai:
Computational investigations of the optimality of two- and three-dimensional triangulations under several criteria.
Electronic Edition (link) BibTeX
Frank Weller:
On the total correctness of lawson's oriented walk algorithm.
Electronic Edition (link) BibTeX