2093 search results - page 165 / 419 » Statistical Point Geometry |
COMPGEOM
2006
ACM
15 years 9 months ago
2006
ACM
We consider the problem of balancing the load among m service-providing facilities, while keeping the total cost low. Let R be the underlying demand region, and let p1, . . . , pm...
155
click to vote
COMPGEOM
2006
ACM
15 years 9 months ago
2006
ACM
A triangulation of a planar point set S is a maximal plane straight-line graph with vertex set S. In the minimum weight triangulation (MWT) problem, we are looking for a triangula...
115
Voted
COMPGEOM
2003
ACM
15 years 9 months ago
2003
ACM
Let P be a set of n points in Rd. The radius of a k-dimensional flat F with respect to P, denoted by RD(F, P), is defined to be maxp∈P dist(F, p), where dist(F, p) denotes the...
125
click to vote
RT
2001
Springer
15 years 8 months ago
2001
Springer
Opacity shadow maps approximate light transmittance inside a complex volume with a set of planar opacity maps. A volume made of standard primitives (points, lines, and polygons) i...
133
Voted
SIGGRAPH
1993
ACM
15 years 8 months ago
1993
ACM
We present a method for solving the following problem: Given a set of data points scattered in three dimensions and an initial triangular mesh M0, produce a mesh M, of the same to...