default search action
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. - Jin Akiyama, Gisaku Nakamura, Eduardo Rivera-Campo, Jorge Urrutia:
Perfect divisions of a cake. - Lyudmil Aleksandrov, Hristo N. Djidjev:
Maintaining partitions of dynamic planar meshes. - 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 P. Gewali:
Constructing median constrained minimum spanning tree. - Binay K. Bhattacharya, Subir Kumar Ghosh:
Characterizing lr-visibility polygons and related problems. - Therese 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 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 Sacristán, Thomas C. Shermer, Godfried T. Toussaint:
Finding specified sections of arrangements: 2d results. - Prosenjit Bose, Jean-Denis Caron, Kilani Ghoudi:
Detection of text-line orientation. - Prosenjit Bose, Jurek Czyzowicz, Dominic Lessard:
Cutting rectangles in equal area pieces. - Danny Z. Chen, Jinhui Xu:
An efficient direct approach for computing shortest rectilinear paths among obstacles in a two-layer interconnection model. - Paolo Cignoni, Leila De Floriani:
Power diagram depth sorting. - Felipe Contreras, Jurek Czyzowicz, Nicolas Fraiji, Jorge Urrutia:
Illuminating triangles and quadrilaterals with vertex floodlights. - Jurek Czyzowicz, F. Contreras-Alcalá, Jorge Urrutia:
On measuring areas of polygons. - 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. - Stephan J. Eidenbenz, Christoph Stamm, Peter Widmayer:
Inapproximability of some art gallery problems. - 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. - Mohammad Ghodsi, Jörg-Rüdiger Sack:
A coarse grained parallel solution to terrain simplification. - André Guéziec, Gabriel Taubin:
A framework for memory-efficient levels of detail. - Leonidas J. Guibas, Li Zhang:
Euclidean proximity and power diagrams. - M. Carmen Hernando, Ferran Hurtado, Alberto Márquez, Mercè Mora, Marc Noy:
Geometric tree graphs of points in the plane. - Kiyoshi Hosono, Masatsugu Urabe:
On a disjoint quadrilateral partition for a given point se. - 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. - Ferran Hurtado, Marc Noy, Jorge Urrutia:
Parallel edge flipping. - Ferran Hurtado, Vera Sacristán, Godfried T. Toussaint:
Constrainted facility location. - Mary Inaba, Hiroshi Imai:
Geometric clustering models for multimedia databases. - Konstantinos G. Kakoulis, Ioannis G. Tollis:
On the multiple label placement problem. - Atsushi Kaneko, Mikio Kano:
Balanced partitions of two sets of points in the plane. - Atsushi Kaneko, Mikio Kano, Shin-ichi Tokunaga:
Straight-line embeddings of three rooted trees in the plane. - J. Mark Keil, Jack Snoeyink:
On the time bound for convex decomposition of simple polygons. - Alejandro López-Ortiz, Sven Schuierer:
The exact cost of exploring streets with a cab. - Andrzej Lingas:
Subexponential-time algorithms for minimum weight triangulations and related problems. - Giuseppe Liotta:
A note on checking proximity graphs. - Bor-Kuan Lu, Fang-Rong Hsu, Chuan Yi Tang:
Guarding in a simple polygon. - 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. - Elsa Omaña-Pulido, Godfried T. Toussaint:
Aperture-angle optimization problems in 3 dimensions. - Kensuke Onishi, Hiroshi Imai:
Riemannian computational geometry: Voronoi diagram delaunay-type triangulation in dually flat space. - Paolo Penna, Paola Vocca:
Proximity drawings of binary trees in polynomial area. - 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 J. Eidenbenz, Renato Pajarola:
A modified longest side bisection triangulation. - William L. Steiger, Rephael Wenger:
Hyperplane depth and nested simplices. - 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.
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 2024-11-19 20:53 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: