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