COMGEO
2008
ACM
13 years 8 months ago
2008
ACM
Given a set of points P Rd and value > 0, an -core-set S P has the property that the smallest ball containing S is within of the smallest ball containing P. This paper shows ...
COMGEO
2008
ACM
13 years 8 months ago
2008
ACM
We study the following problem: Given a set of red points and a set of blue points on the plane, find two unit disks CR and CB with disjoint interiors such that the number of red ...
COMGEO
2008
ACM
13 years 8 months ago
2008
ACM
Let G be a connected plane geometric graph with n vertices. In this paper, we study bounds on the number of edges required to be added to G to obtain 2-vertex or 2-edge connected ...
COMGEO
2008
ACM
13 years 8 months ago
2008
ACM
The flow complex is a geometric structure, similar to the Delaunay tessellation, to organize a set of (weighted) points in Rk. Flow shapes are topological spaces corresponding to ...
COMGEO
2008
ACM
13 years 8 months ago
2008
ACM
We provide an algorithm for unfolding the surface of any orthogonal polyhedron that falls into a particular shape class we call Manhattan Towers, to a nonoverlapping planar orthog...
COMGEO
2008
ACM
13 years 8 months ago
2008
ACM
A wireless ad-hoc network can be represented as a graph in which the nodes represent wireless devices, and the links represent pairs of nodes that communicate directly by means of...
COMGEO
2008
ACM
13 years 8 months ago
2008
ACM
COMGEO
2008
ACM
13 years 8 months ago
2008
ACM
Given S1, a finite set of points in the plane, we define a sequence of point sets Si as follows: With Si already determined, let Li be the set of all the line segments connecting ...
COMGEO
2008
ACM
13 years 8 months ago
2008
ACM
COMGEO
2008
ACM
13 years 8 months ago
2008
ACM
We propose a method to approximate a polyhedral object with a deformable smooth surface, namely the t-skin defined by Edelsbrunner