|
|
Conferences in DBLP
Watchman route in a simple polygon with a rubberband algorithm. [Citation Graph (, )][DBLP]
Multi-guard covers for polygonal regions. [Citation Graph (, )][DBLP]
The 3-dimensional searchlight scheduling problem. [Citation Graph (, )][DBLP]
Some properties of higher order delaunay and gabriel graphs. [Citation Graph (, )][DBLP]
Existence of zone diagrams in compact subsets of uniformly convex spaces. [Citation Graph (, )][DBLP]
Blocking delaunay triangulations. [Citation Graph (, )][DBLP]
Those ubiquitous cut polyhedra. [Citation Graph (, )][DBLP]
Connected dominating sets on dynamic geometric graphs. [Citation Graph (, )][DBLP]
Stable roommates and geometric spanners. [Citation Graph (, )][DBLP]
3d local algorithm for dominating sets of unit disk graphs. [Citation Graph (, )][DBLP]
Direction assignment in wireless networks. [Citation Graph (, )][DBLP]
Combinatorial changes of euclidean minimum spanning tree of moving points in the plane. [Citation Graph (, )][DBLP]
k-sets and continuous motion in R3. [Citation Graph (, )][DBLP]
An optimal solution for dynamic polar diagram. [Citation Graph (, )][DBLP]
Towards a dynamic data structure for efficient bounded line range search. [Citation Graph (, )][DBLP]
On degeneracy of lower envelopes of algebraic surfaces. [Citation Graph (, )][DBLP]
Ghost chimneys. [Citation Graph (, )][DBLP]
Deflating polygons to the limit. [Citation Graph (, )][DBLP]
Coloring geometric hypergraph defined by an arrangement of half-planes. [Citation Graph (, )][DBLP]
On a dispersion problem in grid labeling. [Citation Graph (, )][DBLP]
Robot kabaddi. [Citation Graph (, )][DBLP]
Open problem session. [Citation Graph (, )][DBLP]
Compatible pointed pseudo-triangulations. [Citation Graph (, )][DBLP]
Optimal encoding of triangular and quadrangular meshes with fixed topology. [Citation Graph (, )][DBLP]
Bounded-degree polyhedronization of point sets. [Citation Graph (, )][DBLP]
Triangulations with many points of even degree. [Citation Graph (, )][DBLP]
Maximum geodesic routing in the plane with obstacles. [Citation Graph (, )][DBLP]
Evading equilateral triangles without a map. [Citation Graph (, )][DBLP]
Watchman tours for polygons with holes. [Citation Graph (, )][DBLP]
Visibility maintenance of a moving segment observer inside polygons with holes. [Citation Graph (, )][DBLP]
I/O efficient path traversal in well-shaped tetrahedral meshes. [Citation Graph (, )][DBLP]
Regular labelings and geometric structures. [Citation Graph (, )][DBLP]
Approximate euclidean ramsey theorems. [Citation Graph (, )][DBLP]
Finding minimal bases in arbitrary spline spaces. [Citation Graph (, )][DBLP]
Any monotone boolean function can be realized by interlocked polygons. [Citation Graph (, )][DBLP]
Complete enumeration of small realizable oriented matroids. [Citation Graph (, )][DBLP]
Oja medians and centers of gravity. [Citation Graph (, )][DBLP]
The projection median of a set of points in Rd. [Citation Graph (, )][DBLP]
Small strong epsilon nets. [Citation Graph (, )][DBLP]
New epsilon-net constructions. [Citation Graph (, )][DBLP]
On the perimeter of fat objects. [Citation Graph (, )][DBLP]
Sweeping minimum perimeter enclosing parallelograms: Optimal crumb cleanup. [Citation Graph (, )][DBLP]
Minimum enclosing area triangle with a fixed angle. [Citation Graph (, )][DBLP]
Approximate shortest path algorithms for sequences of pairwise disjoint simple polygons. [Citation Graph (, )][DBLP]
Speed-constrained geodesic fréchet distance inside a simple polygon. [Citation Graph (, )][DBLP]
Hausdorff core of a one reflex vertex polygon. [Citation Graph (, )][DBLP]
Computing straight skeletons of planar straight-line graphs based on motorcycle graphs. [Citation Graph (, )][DBLP]
Minimum-area drawings of plane 3-trees. [Citation Graph (, )][DBLP]
Approximating the independent domatic partition problem in random geometric graphs - an experimental study. [Citation Graph (, )][DBLP]
Orthogonal thickness of graphs. [Citation Graph (, )][DBLP]
Shooting bricks with orthogonal laser beams: A first step towards internal/external map labeling. [Citation Graph (, )][DBLP]
Computing the straight skeleton of a monotone polygon in O(n log n) time. [Citation Graph (, )][DBLP]
On the variance of random polygons. [Citation Graph (, )][DBLP]
k-star-shaped polygons. [Citation Graph (, )][DBLP]
Zipper unfoldings of polyhedral complexes. [Citation Graph (, )][DBLP]
On stretch minimization problem on unit strip paper. [Citation Graph (, )][DBLP]
Determining the robustness of sensor barriers. [Citation Graph (, )][DBLP]
A new algorithm and improved lower bound for point placement on a line in two rounds. [Citation Graph (, )][DBLP]
Constrained k-center and movement to independence. [Citation Graph (, )][DBLP]
Computing minimum limited-capacity matching in one-dimensional space and for the points lying on two perpendicular lines. [Citation Graph (, )][DBLP]
New variations of the reverse facility location problem. [Citation Graph (, )][DBLP]
I/O-efficient triangular range search and its application. [Citation Graph (, )][DBLP]
Range aggregate structures for colored geometric objects. [Citation Graph (, )][DBLP]
Approximating range-aggregate queries using coresets. [Citation Graph (, )][DBLP]
The traveling salesman problem for lines and rays in the plane. [Citation Graph (, )][DBLP]
Fast local searches and updates in bounded universes. [Citation Graph (, )][DBLP]
Cluster connecting problem inside a polygon. [Citation Graph (, )][DBLP]
Finding monochromatic l-shapes in bichromatic point sets. [Citation Graph (, )][DBLP]
On polygons excluding point sets. [Citation Graph (, )][DBLP]
Six-way equipartitioning by three lines in the plane. [Citation Graph (, )][DBLP]
|
