Conferences in DBLP
Polynomial irreducibility testing through Minkowski summand computation. [Citation Graph (, )][DBLP ] Empty Monochromatic Triangles. [Citation Graph (, )][DBLP ] Guaranteed Voronoi Diagrams of Uncertain Sites. [Citation Graph (, )][DBLP ] Draining a Polygon - or - Rolling a Ball out of a Polygon. [Citation Graph (, )][DBLP ] Competitive Search for Longest Empty Intervals. [Citation Graph (, )][DBLP ] Data Structures for Range-Aggregate Extent Queries. [Citation Graph (, )][DBLP ] Maximal Covering by Two Isothetic Unit Squares. [Citation Graph (, )][DBLP ] Triangulating and Guarding Realistic Polygons. [Citation Graph (, )][DBLP ] Polygons Folding to Plural Incongruent Orthogonal Boxes. [Citation Graph (, )][DBLP ] Searching for Frequent Colors in Rectangles. [Citation Graph (, )][DBLP ] A Distributed Algorithm for Computing Voronoi Diagram in the Unit Disk Graph Model. [Citation Graph (, )][DBLP ] Partitioning a Polygon into Two Mirror Congruent Pieces. [Citation Graph (, )][DBLP ] On distinct distances among points in general position and other related problems. [Citation Graph (, )][DBLP ] On a Cone Covering Problem. [Citation Graph (, )][DBLP ] Improved Bounds on the Average Distance to the Fermat-Weber Center of a Convex Object. [Citation Graph (, )][DBLP ] Minimum blocking sets of circles for a set of lines in the plane. [Citation Graph (, )][DBLP ] Linear-Size Meshes. [Citation Graph (, )][DBLP ] Exact Pareto-Optimal Coordination of Two Translating Polygonal Robots on a Cyclic Roadmap. [Citation Graph (, )][DBLP ] A Framework for Multi-Core Implementations of Divide and Conquer Algorithms and its Application to the Convex Hull Problem. [Citation Graph (, )][DBLP ] Generalized Ham-Sandwich Cuts for Well Separated Point Sets. [Citation Graph (, )][DBLP ] A Class of Convex Polyhedra with Few Edge Unfoldings. [Citation Graph (, )][DBLP ] Application of computational geometry to network p-center location problems. [Citation Graph (, )][DBLP ] Recognition of Largest Empty Orthoconvex Polygon in a Point Set. [Citation Graph (, )][DBLP ] Smallest enclosing circle centered on a query line segment. [Citation Graph (, )][DBLP ] Direct Planar Tree Transformation and Counterexample. [Citation Graph (, )][DBLP ] Polygonal Chain Simplification with Small Angle Constraints. [Citation Graph (, )][DBLP ] Achieving Spatial Adaptivity while Finding Approximate Nearest Neighbors. [Citation Graph (, )][DBLP ] Inverting Linkages with Stretch. [Citation Graph (, )][DBLP ] VC-Dimension of Visibility on Terrains. [Citation Graph (, )][DBLP ] Convex Hull of the Union of Convex Objects in the Plane: an Adaptive Analysis. [Citation Graph (, )][DBLP ] A Pumping Lemma for Homometric Rhythms. [Citation Graph (, )][DBLP ] Computational Balloon Twisting: The Theory of Balloon Polyhedra. [Citation Graph (, )][DBLP ] Data Structures for Restricted Triangular Range Searching. [Citation Graph (, )][DBLP ] A generalization of Apollonian packing of circles. [Citation Graph (, )][DBLP ] The Embroidery Problem. [Citation Graph (, )][DBLP ] The Focus of Attention Problem Revisited. [Citation Graph (, )][DBLP ] Fault-Tolerant Conflict-Free Coloring. [Citation Graph (, )][DBLP ] The Steiner Ratio for Obstacle-Avoiding Rectilinear Steiner Trees. [Citation Graph (, )][DBLP ] A note on alpha-drawable k-trees. [Citation Graph (, )][DBLP ] On the Complexity of Point Recolouring in Geometric Graphs. [Citation Graph (, )][DBLP ] Isometric Morphing of Triangular Meshes. [Citation Graph (, )][DBLP ] Memory Requirements for Local Geometric Routing and Traversal in Digraphs. [Citation Graph (, )][DBLP ] An Efficient Query Structure for Mesh Refinement. [Citation Graph (, )][DBLP ] On the nonexistence of dimension reduction for $\ell2_2$ metrics. [Citation Graph (, )][DBLP ] Computing the Stretch Factor of Paths, Trees, and Cycles in Weighted Fixed Orientation Metrics. [Citation Graph (, )][DBLP ] Monochromatic simplices of any volume. [Citation Graph (, )][DBLP ] The Solution Path of the Slab Support Vector Machine. [Citation Graph (, )][DBLP ] Adaptive Searching in One and Two Dimensions. [Citation Graph (, )][DBLP ] Partial Matching of Planar Polygons Under Translation and Rotation. [Citation Graph (, )][DBLP ] Computing Dehn Twists and Geometric Intersection Numbers in Polynomial Time. [Citation Graph (, )][DBLP ] Core-Preserving Algorithms. [Citation Graph (, )][DBLP ] Polar Diagram of Moving Objects. [Citation Graph (, )][DBLP ]