19 search results - page 2 / 4 » comgeo 2008 |
82
Voted
COMGEO
2008
ACM
14 years 11 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
69
Voted
COMGEO
2008
ACM
14 years 11 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
14 years 11 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
14 years 11 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 ...
108
click to vote
COMGEO
2008
ACM
14 years 11 months ago
2008
ACM
In this paper we consider the problem of decomposing a simple polygon into subpolygons that exclusively use vertices of the given polygon. We allow two types of subpolygons: pseud...