2093 search results - page 99 / 419 » Statistical Point Geometry |
121
Voted
COMPGEOM
1993
ACM
15 years 6 months ago
1993
ACM
For a polygon P, the bounded Voronoi diagram of P is a partition of P into regions assigned to the vertices of P. A point p inside P belongs to the region of a vertex v if and onl...
COMPGEOM
1989
ACM
15 years 6 months ago
1989
ACM
We present algorithms that decompose an algebraic curve with rational coefficients in its defining bivariate equation into its irreducible real factors and its non-empty irreducib...
120
click to vote
COMPGEOM
2007
ACM
15 years 6 months ago
2007
ACM
The Bentley-Ottmann (BO) algorithm, initially designed to report the intersection points of line-segments in the plane, is the prototypical sweep-line algorithm. This video presen...
119
Voted
COMPGEOM
2006
ACM
15 years 6 months ago
2006
ACM
We prove that any collection of n discs in which each one intersects at most k others, can be colored with at most O(log3 k) colors so that for each point p in the union of all di...
104
Voted
DGCI
2006
Springer
15 years 6 months ago
2006
Springer
Abstract. Existing theories on shape digitization impose strong constraints on feasible shapes and require error-free measurements. We use Delaunay triangulation and -shapes to pro...