Conferences in DBLP
Frank Weller Stability of voronoi neighborship under perturbations of the sites. [Citation Graph (0, 0)][DBLP ] Conf ] Joseph O'Rourke Vertex pi-lights for monotone mountains. [Citation Graph (0, 0)][DBLP ] Conf ] Dominique Michelucci A quadratic non-standard arthmetic. [Citation Graph (0, 0)][DBLP ] Conf ] Christos Makris , Athanasios K. Tsakalidis Fast piercing of iso-oriented rectangles. [Citation Graph (0, 0)][DBLP ] Conf ] Christophe Lemaire , Jean-Michel Moreau Analysis of a class of k-dimensional merge procedures, with an application to 2d delaunay triangulation in expected linear time after two-directional sorting. [Citation Graph (0, 0)][DBLP ] Conf ] Michael G. Lamoureux , Joseph Douglas Horton , Bradford G. Nickerson Dynamizing domination queries in 2-dimensions: The paper stabbing problem revisited. [Citation Graph (0, 0)][DBLP ] Conf ] Evangelos Kranakis , Anthony Spatharis Almost optimal on-line search in unknown streets. [Citation Graph (0, 0)][DBLP ] Conf ] M. Kano A straight-line embedding of two or more rooted trees in the plane. [Citation Graph (0, 0)][DBLP ] Conf ] Atsushi Kaneko A balanced partition of points in the plane and tree embedding problems. [Citation Graph (0, 0)][DBLP ] Conf ] Fabrice Jaillet , Behzad Shariat , Denis Vorpe Periodic b-spline surface skinning of anatomic shapes. [Citation Graph (0, 0)][DBLP ] Conf ] Naixun Pei , Sue Whitesides On folding rulers in regular polygons. [Citation Graph (0, 0)][DBLP ] Conf ] Serge Pontier , Behzad Shariat , Denis Vorpe Shape reconstruction using skeleton-based implicit surface. [Citation Graph (0, 0)][DBLP ] Conf ] Cao An Wang , Binhai Zhu Shooter location problems revisited. [Citation Graph (0, 0)][DBLP ] Conf ] Jorge Urrutia On the number of internal and external visibility edges of polygons. [Citation Graph (0, 0)][DBLP ] Conf ] Masatsugu Urabe On a partition of point sets into convex polygons. [Citation Graph (0, 0)][DBLP ] Conf ] Göktürk Üçoluk , Ismail Hakki Toroslu Reconstruction of 3-D surface object from its pieces. [Citation Graph (0, 0)][DBLP ] Conf ] Sergey P. Tarasov On hardness of roundness calculation. [Citation Graph (0, 0)][DBLP ] Conf ] Bettina Speckmann , Jack Snoeyink Easy triangle strips for tin terrain models. [Citation Graph (0, 0)][DBLP ] Conf ] Stéphane Rivière Walking in the visibility complex with applications to visibility polygons and dynamic visibility. [Citation Graph (0, 0)][DBLP ] Conf ] Eduardo Rivera-Campo , Virginia Urrutia-Galicia A note on the tree graph of a set of points in the plane. [Citation Graph (0, 0)][DBLP ] Conf ] Francois Rebufat Handling rotations in the placement of curved convex polygons. [Citation Graph (0, 0)][DBLP ] Conf ] Toshiyuki Imai Some methods to determine the sign of a long integer from its remainders. [Citation Graph (0, 0)][DBLP ] Conf ] Kiyoshi Hosono , Katsumi Matsuda Geometric matching problem of disjoint compact convex sets by line segments. [Citation Graph (0, 0)][DBLP ] Conf ] Subir Kumar Ghosh , Joel W. Burdick Understanding discrete visibility and related approximation algorithms. [Citation Graph (0, 0)][DBLP ] Conf ] Cavit Aydin , Doug Ierardi Partitioning algorithms for transportation graphs and their applications to routing. [Citation Graph (0, 0)][DBLP ] Conf ] Mikhail J. Atallah , Danny Z. Chen , Kevin S. Klenk Parallel algorithms for longest increasing chains in the plane and related problems. [Citation Graph (0, 0)][DBLP ] Conf ] Francois Anton , Christopher M. Gold An iterative algorithm for the determination of voronoi vertices in polygonal and non-polygonal domains. [Citation Graph (0, 0)][DBLP ] Conf ] Ngoc-Minh Lê Jin akiyama. [Citation Graph (0, 0)][DBLP ] Conf ] Binay K. Bhattacharya Biased search and k-point clustering. [Citation Graph (0, 0)][DBLP ] Conf ] Gautam Das The visibility graph contains a bounded-degree spanner. [Citation Graph (0, 0)][DBLP ] Conf ] Sergei Bespamyatnikh , Michael Segal Covering a set of points by two axis-parallel boxes. [Citation Graph (0, 0)][DBLP ] Conf ] Pankaj K. Agarwal , Marc J. van Kreveld , Subhash Suri Label placement by maximum independent set in rectangles. [Citation Graph (0, 0)][DBLP ] Conf ] Bruno Adam , Pierre Kauffmann , Dominique Schmitt , Jean-Claude Spehner An increasing-circle sweep-algorithm to construct the delaunay diagram in the plane. [Citation Graph (0, 0)][DBLP ] Conf ] Mark Babikov , Diane L. Souvaine , Rephael Wenger Constructing piecewise linear homeomorphisms of polygons with holes. [Citation Graph (0, 0)][DBLP ] Conf ] Markus Denny , Christian Sohler Encoding a triangulation as a permutation of its point set. [Citation Graph (0, 0)][DBLP ] Conf ] Subir Kumar Ghosh , Joel W. Burdick An on-line algorithm for exploring an unknown polygonal environment by a point robot. [Citation Graph (0, 0)][DBLP ] Conf ] Laxmi Gewali , Jay Bagga , S. Dey , J. Emert , J. McGrew Contracted visibility graphs of line segments. [Citation Graph (0, 0)][DBLP ] Conf ] Artur Fuhrmann Testing roundness of a polytope and related problems. [Citation Graph (0, 0)][DBLP ] Conf ] Hazel Everett , Chính T. Hoàng , Kyriakos Kilakos , Marc Noy Planar segment visibility graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Jurek Czyzowicz , Evangelos Kranakis , Jorge Urrutia Domino tilings and two-by-two squares. [Citation Graph (0, 0)][DBLP ] Conf ] Frédo Durand , George Drettakis , Claude Puech The 3d visibility complex: a unified data-structure for global visibility of scenes of polygons and smooth objects. [Citation Graph (0, 0)][DBLP ] Conf ] Francisco Javier Cobos , Juan Carlos Dana , Clara I. Grima , Alberto Márquez Diameter of a set on the cylinder. [Citation Graph (0, 0)][DBLP ] Conf ] Francisco Javier Cobos , Juan Carlos Dana , Clara I. Grima , Alberto Márquez The width of a convex set on the sphere. [Citation Graph (0, 0)][DBLP ] Conf ] Carsten Dorgerloh , Jens Luessem , Morakot Pilouk , Juergen Wirtgen Some tools for modeling and analysis of surfaces. [Citation Graph (0, 0)][DBLP ] Conf ] Fausto Bernardini , Chandrajit L. Bajaj Sampling and reconstructing manifolds using alpha-shapes. [Citation Graph (0, 0)][DBLP ] Conf ] 