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. 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.
- Pierre Alliez, Olivier Devillers, Jack Snoeyink: Removing degeneracies by perturbing the problem or perturbing the world.
- Francois Anton, Darka Mioc, Christopher M. Gold: Dynamic additively weighted voronoi diagrams made easy.
- Chandrajit L. Bajaj, Valerio Pascucci, Robert J. Holt, Arun N. Netravali: Dynamic maintenance and visualization of molecular surfaces.
- Mark de Berg, Prosenjit Bose, David Bremner, William S. Evans, Lata Narayanan: Recovering lines with fixed linear probes.
- Joy Bhadury, Ramaswamy Chandrasekaran, Laxmi Gewali: Constructing median constrained minimum spanning tree.
- Binay K. Bhattacharya, Subir Kumar Ghosh: Characterizing lr-visibility polygons and related problems.
- 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.
- Therese C. Biedl, Erik D. Demaine, Martin L. Demaine, Anna Lubiw, Godfried T. Toussaint: Hiding disks in folded polygons.
- 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.
- Daciana Bochis, Francisco Santos: Towards a realistic upper bound for the number of facets of 3-dimensional dirichlet stereohedr.
- 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.
- Danny Z. Chen, Jinhui Xu: An efficient direct approach for computing shortest rectilinear paths among obstacles in a two-layer interconnection model.
- Felipe Contreras, Jurek Czyzowicz, Nicolas Fraiji, Jorge Urrutia: Illuminating triangles and quadrilaterals with vertex floodlights.
- José Miguel Díaz-Báñez, Francisco Gómez, Ferran Hurtado: Some problems on approximation of set of points by polygonal curves.
- Adrian Dumitrescu: Planar sets with few empty convex polygons.
- Regina Estkowski: No steiner point subdivision simplification is NP-complete.
- Hazel Everett, Sylvain Lazard, Steven M. Robbins, H. Schröder, Sue Whitesides: Convexifying star-shaped polygons.
- Francisco Gómez, Ferran Hurtado, Joan Antoni Sellarès, Godfried T. Toussaint: Perspective projections and removal of degeneracies.
- Jesus Garcia-Lopez, Pedro A. Ramos: Shortest paths and visibility inside triangulated curved polygons with applications to conic visibility.
- M. Carmen Hernando, Ferran Hurtado, Alberto Márquez, Mercè Mora, Marc Noy: Geometric tree graphs of points in the plane.
- Ernst Huber: Intersecting general parametric surfaces using bounding volumes.
- Ferran Hurtado, Marc Noy, Pedro A. Ramos, Carlos Seara: Separating objects in the plane with wedges and strips.
- Atsushi Kaneko, Mikio Kano, Shin-ichi Tokunaga: Straight-line embeddings of three rooted trees in the plane.
- Andrzej Lingas: Subexponential-time algorithms for minimum weight triangulations and related problems.
- Giuseppe Liotta: A note on checking proximity graphs.
- David M. Mount, Nathan S. Netanyahu, Christine D. Piatko, Ruth Silverman, Angela Y. Wu: Quantile approximation for robust statistical estimation.
- Frank Nielsen: On point covers of c-oriented polygons.
- Antonio A. F. Oliveira, Luiz M. G. Gonçalves, Claudio Esperança: Towards a contour morphing preserving differentiability.
- Kensuke Onishi, Hiroshi Imai: Riemannian computational geometry: Voronoi diagram delaunay-type triangulation in dually flat space.
- Markus Schneider, Ralf Hartmut Güting, Thomas de Ridder: Computational geometry on the grid: Transversal and planesweep algorithms for spatial applications.
- Michael A. Soss: The size of the open sphere of influence graph in metric spaces.
- Christoph Stamm, Stephan Eidenbenz, Renato Pajarola: A modified longest side bisection triangulation.
- Akira Tajima, Hiroshi Imai: Computational investigations of the optimality of two- and three-dimensional triangulations under several criteria.
- Frank Weller: On the total correctness of lawson's oriented walk algorithm.
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-06-17T203624 by the dblp team