Conferences in DBLP
New Algorithms for Computing Maximum Perimeter and Maximum Area of the Convex Hull of Imprecise Inputs Based On the Parallel Line Segment Model. [Citation Graph (, )][DBLP ] Optimal Empty Pseudo-Triangles in a Point Set. [Citation Graph (, )][DBLP ] Clarkson's Algorithm for Violator Spaces. [Citation Graph (, )][DBLP ] On Graph Thickness, Geometric Thickness, and Separator Theorems. [Citation Graph (, )][DBLP ] Colored Simultaneous Geometric Embeddings and Universal Pointsets. [Citation Graph (, )][DBLP ] On Directed Graphs with an Upward Straight-line. [Citation Graph (, )][DBLP ] Computational Geometry of Contour Extraction. [Citation Graph (, )][DBLP ] Enumeration of Polyominoes for p4 Tiling. [Citation Graph (, )][DBLP ] Packing 2×2 unit squares into grid polygons is NP-complete. [Citation Graph (, )][DBLP ] Symmetry Restoration by Stretching. [Citation Graph (, )][DBLP ] On symmetric realizations of the simplicial complex of 3-crossing-free sets of diagonals of the octagon. [Citation Graph (, )][DBLP ] Generalized jewels and the point placement problem. [Citation Graph (, )][DBLP ] Generalizations of Interval Graphs. [Citation Graph (, )][DBLP ] A Comparison of Two Fully-Dynamic Delaunay Triangulation Methods. [Citation Graph (, )][DBLP ] Minimizing Slope Change in Imprecise 1.5D terrains. [Citation Graph (, )][DBLP ] Slope Preserving Terrain Simplification - An Experimental Study. [Citation Graph (, )][DBLP ] Rigid Components of Random Graphs. [Citation Graph (, )][DBLP ] Angular rigidity in 3D: combinatorial characterizations and algorithms. [Citation Graph (, )][DBLP ] Nucleation-free 3D rigidity. [Citation Graph (, )][DBLP ] Open Problems from CCCG 2008. [Citation Graph (, )][DBLP ] The Centervertex Theorem for Wedge Depth. [Citation Graph (, )][DBLP ] Streaming 1-Center with Outliers in High Dimensions. [Citation Graph (, )][DBLP ] Constant-Working-Space Algorithms for Geometric Problems. [Citation Graph (, )][DBLP ] Every four-colorable graph is isomorphic to a subgraph of the Visibility Graph of the Integer Lattice. [Citation Graph (, )][DBLP ] Planar Packing of Diameter-Four Trees. [Citation Graph (, )][DBLP ] Every Large Point Set contains Many Collinear Points or an Empty Pentagon. [Citation Graph (, )][DBLP ] On the Height of a Homotopy. [Citation Graph (, )][DBLP ] Computing Fréchet Distance with Speed Limits. [Citation Graph (, )][DBLP ] General minisum circle location. [Citation Graph (, )][DBLP ] Approximating Maximum Flow in Polygonal Domains using Spanners. [Citation Graph (, )][DBLP ] Bold Graph Drawings. [Citation Graph (, )][DBLP ] Defining and computing accessibility radius. [Citation Graph (, )][DBLP ] Intrinsic Multiscale Geometry. [Citation Graph (, )][DBLP ] Data Structures for Reporting Extension Violations in a Query Range. [Citation Graph (, )][DBLP ] Data Structures for Range Aggregation by Categories. [Citation Graph (, )][DBLP ] How to make a picturesque maze. [Citation Graph (, )][DBLP ] An Inequality on the Edge Lengths of Triangular Meshes. [Citation Graph (, )][DBLP ] Integer Point Sets Minimizing Average Pairwise l_{1} Distance: What is the Optimal Shape of a Town? [Citation Graph (, )][DBLP ] Wireless Localization with Vertex Guards is NP-hard. [Citation Graph (, )][DBLP ] Inapproximability of the Perimeter Defense Problem. [Citation Graph (, )][DBLP ] The Bichromatic Rectangle Problem in High Dimensions. [Citation Graph (, )][DBLP ] On the Dilation of Delaunay Triangulations of Points in Convex Position. [Citation Graph (, )][DBLP ] The spanning ratio of the Delaunay triangulation is greater than pi/2. [Citation Graph (, )][DBLP ] Relaxed Gabriel Graphs. [Citation Graph (, )][DBLP ] Teaching Computational Geometry, II. [Citation Graph (, )][DBLP ]