Abstract is missing.
- A framework for memory-efficient levels of detailAndré Guéziec, Gabriel Taubin. [doi]
- The exact cost of exploring streets with a cabAlejandro López-Ortiz, Sven Schuierer. [doi]
- Quantile approximation for robust statistical estimationDavid M. Mount, Nathan S. Netanyahu, Christine D. Piatko, Ruth Silverman, Angela Y. Wu. [doi]
- Guarding in a simple polygonBor-Kuan Lu, Fang-Rong Hsu, Chuan Yi Tang. [doi]
- Euclidean proximity and power diagramsLeonidas J. Guibas, Li Zhang. [doi]
- Hyperplane depth and nested simplicesWilliam L. Steiger, Rephael Wenger. [doi]
- Power diagram depth sortingPaolo Cignoni, Leila De Floriani. [doi]
- The size of the open sphere of influence graph in metric spacesMichael A. Soss. [doi]
- Convexifying star-shaped polygonsHazel Everett, Sylvain Lazard, Steven M. Robbins, H. Schröder, Sue Whitesides. [doi]
- Riemannian computational geometry: Voronoi diagram delaunay-type triangulation in dually flat spaceKensuke Onishi, Hiroshi Imai. [doi]
- Computational investigations of the optimality of two- and three-dimensional triangulations under several criteriaAkira Tajima, Hiroshi Imai. [doi]
- Removing degeneracies by perturbing the problem or perturbing the worldPierre Alliez, Olivier Devillers, Jack Snoeyink. [doi]
- Proximity drawings of binary trees in polynomial areaPaolo Penna, Paola Vocca. [doi]
- Hiding disks in folded polygonsTherese C. Biedl, Erik D. Demaine, Martin L. Demaine, Anna Lubiw, Godfried T. Toussaint. [doi]
- Balanced partitions of two sets of points in the planeAtsushi Kaneko, Mikio Kano. [doi]
- Inapproximability of some art gallery problemsStephan Eidenbenz, Christoph Stamm, Peter Widmayer. [doi]
- No steiner point subdivision simplification is NP-completeRegina Estkowski. [doi]
- On point covers of c-oriented polygonsFrank Nielsen. [doi]
- Dynamic maintenance and visualization of molecular surfacesChandrajit L. Bajaj, Valerio Pascucci, Robert J. Holt, Arun N. Netravali. [doi]
- Subexponential-time algorithms for minimum weight triangulations and related problemsAndrzej Lingas. [doi]
- Geometric tree graphs of points in the planeM. Carmen Hernando, Ferran Hurtado, Alberto Márquez, Mercè Mora, Marc Noy. [doi]
- On the time bound for convex decomposition of simple polygonsJ. Mark Keil, Jack Snoeyink. [doi]
- Characterizing lr-visibility polygons and related problemsBinay K. Bhattacharya, Subir Kumar Ghosh. [doi]
- A note on checking proximity graphsGiuseppe Liotta. [doi]
- Computational geometry on the grid: Transversal and planesweep algorithms for spatial applicationsMarkus Schneider, Ralf Hartmut Güting, Thomas de Ridder. [doi]
- On the multiple label placement problemKonstantinos G. Kakoulis, Ioannis G. Tollis. [doi]
- A shrinking-circle sweep-algorithm to construct the farthest site delaunay diagram in the planeBruno Adam, Pierre Kauffmann, Dominique Schmitt, Jean-Claude Spehner. [doi]
- Geometric clustering models for multimedia databasesMary Inaba, Hiroshi Imai. [doi]
- Maintaining partitions of dynamic planar meshesLyudmil Aleksandrov, Hristo Djidjev. [doi]
- Parallel edge flippingFerran Hurtado, Marc Noy, Jorge Urrutia. [doi]
- Towards a contour morphing preserving differentiabilityAntonio A. F. Oliveira, Luiz M. G. Gonçalves, Claudio Esperança. [doi]
- Aperture-angle optimization problems in 3 dimensionsElsa Omaña-Pulido, Godfried T. Toussaint. [doi]
- A coarse grained parallel solution to terrain simplificationMohammad Ghodsi, Jörg-Rüdiger Sack. [doi]
- On a disjoint quadrilateral partition for a given point seKiyoshi Hosono, Masatsugu Urabe. [doi]
- Dynamic additively weighted voronoi diagrams made easyFrancois Anton, Darka Mioc, Christopher M. Gold. [doi]
- Constructing median constrained minimum spanning treeJoy Bhadury, Ramaswamy Chandrasekaran, Laxmi Gewali. [doi]
- Unfolding some classes of orthogonal polyhedraTherese C. Biedl, Erik D. Demaine, Martin L. Demaine, Anna Lubiw, Mark H. Overmars, Joseph O Rourke, Steve Robbins, Sue Whitesides. [doi]
- On reconfiguring tree linkages: Trees can lockTherese C. Biedl, Erik D. Demaine, Martin L. Demaine, Sylvain Lazard, Anna Lubiw, Joseph O Rourke, Steve Robbins, Ileana Streinu, Godfried T. Toussaint, Sue Whitesides. [doi]
- On the total correctness of lawson s oriented walk algorithmFrank Weller. [doi]
- A modified longest side bisection triangulationChristoph Stamm, Stephan Eidenbenz, Renato Pajarola. [doi]
- Illuminating triangles and quadrilaterals with vertex floodlightsFelipe Contreras, Jurek Czyzowicz, Nicolas Fraiji, Jorge Urrutia. [doi]
- Perspective projections and removal of degeneraciesFrancisco Gómez, Ferran Hurtado, Joan Antoni Sellarès, Godfried T. Toussaint. [doi]
- On measuring areas of polygonsJurek Czyzowicz, F. Contreras-Alcalá, Jorge Urrutia. [doi]
- Towards a realistic upper bound for the number of facets of 3-dimensional dirichlet stereohedrDaciana Bochis, Francisco Santos. [doi]
- Constrainted facility locationFerran Hurtado, Vera Sacristan, Godfried T. Toussaint. [doi]
- Planar sets with few empty convex polygonsAdrian Dumitrescu. [doi]
- Recovering lines with fixed linear probesMark de Berg, Prosenjit Bose, David Bremner, William S. Evans, Lata Narayanan. [doi]
- Finding specified sections of arrangements: 2d resultsProsenjit Bose, Ferran Hurtado, Henk Meijer, Suneeta Ramaswami, David Rappaport, Vera Sacristan, Thomas C. Shermer, Godfried T. Toussaint. [doi]
- Straight-line embeddings of three rooted trees in the planeAtsushi Kaneko, Mikio Kano, Shin-ichi Tokunaga. [doi]