414 search results - page 78 / 83 » Geometric Semigroup Theory |
101
click to vote
COMPGEOM
2004
ACM
15 years 5 months ago
2004
ACM
Given a set of n points S in the plane, a triangulation of S is a subdivision of the convex hull into triangles whose vertices are from S. In the kinetic setting, the input point ...
84
Voted
MMSEC
2004
ACM
15 years 5 months ago
2004
ACM
CSS, the first system to protect multimedia content on the new DVD medium failed badly, because both its encryption algorithm and its key management could easily be broken. A new ...
102
Voted
SMA
2003
ACM
15 years 4 months ago
2003
ACM
Surface reconstruction from unorganized sample points is an important problem in computer graphics, computer aided design, medical imaging and solid modeling. Recently a few algor...
96
Voted
COMPGEOM
2010
ACM
15 years 4 months ago
2010
ACM
We study the expected number of interior vertices of degree i in a triangulation of a point set S, drawn uniformly at random from the set of all triangulations of S, and derive va...
103
click to vote
COMPGEOM
2010
ACM
15 years 4 months ago
2010
ACM
d Abstract] György Elekes Eötvös University Micha Sharir Tel Aviv University and New York University We first describe a reduction from the problem of lower-bounding the numbe...