COMGEO
2008
ACM
13 years 5 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 5 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 5 months ago
2008
ACM
COMGEO
2008
ACM
13 years 5 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 5 months ago
2008
ACM
COMGEO
2008
ACM
13 years 5 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
COMGEO
2008
ACM
13 years 5 months ago
2008
ACM
Given a planar polygonal subdivision S, the point location problem is to preprocess S into a data structure so that the cell of the subdivision that contains a given query point c...
COMGEO
2008
ACM
13 years 5 months ago
2008
ACM
A randomized linear expected-time algorithm for computing the zonoid depth (Dyckerhoff et al 1996, Mosler 2002) of a point with respect to a fixed dimensional point set is presente...
COMGEO
2008
ACM
13 years 5 months ago
2008
ACM
