Sciweavers

84 search results - page 2 / 17
» Computing Many Faces in Arrangements of Lines and Segments
Sort
View
WADS
2007
Springer
113views Algorithms» more  WADS 2007»
15 years 5 months ago
On Computing the Centroid of the Vertices of an Arrangement and Related Problems
We consider the problem of computing the centroid of all the vertices in a non-degenerate arrangement of n lines. The trivial approach requires the enumeration of all `n 2 ´ verti...
Deepak Ajwani, Saurabh Ray, Raimund Seidel, Hans R...
WAE
2000
95views Algorithms» more  WAE 2000»
15 years 1 months ago
Two-Dimensional Arrangements in CGAL and Adaptive Point Location for Parametric Curves
Given a collection C of curves in the plane, the arrangement of C is the subdivision of the plane into vertices, edges and faces induced by the curves in C. Constructing arrangemen...
Iddo Hanniel, Dan Halperin
COMPGEOM
2001
ACM
15 years 3 months ago
Efficient and small representation of line arrangements with applications
This paper addresses the problem of lossy compression of arrangements. Given an arrangement of n lines in the plane, we show how to construct another arrangement consisting of man...
David P. Dobkin, Ayellet Tal
ISVD
2007
IEEE
15 years 6 months ago
Two-dimensional line space Voronoi Diagram
Given a set of points called sites, the Voronoi diagram is a partition of the plane into sets of points having the same closest site. Several generalizations of the Voronoi diagra...
Stéphane Rivière, Dominique Schmitt
ECCV
1998
Springer
16 years 1 months ago
A Probabilistic Approach to Object Recognition Using Local Photometry and Global Geometry
Many object classes, including human faces, can be modeled as a set of characteristic parts arranged in a variable spatial con guration. We introduce a simpli ed model of a deforma...
Michael C. Burl, Markus Weber, Pietro Perona