Sciweavers

92 search results - page 3 / 19
» Stabbers of line segments in the plane
Sort
View
BMVC
2001
13 years 7 months ago
Estimating the Orientation and Recovery of Text Planes in a Single Image
A method for the fronto-parallel recovery of paragraphs of text under full perspective transformation is presented. The horizontal vanishing point of the text plane is found using...
Paul Clark, Majid Mirmehdi
COMGEO
2008
ACM
13 years 5 months ago
On the density of iterated line segment intersections
Given S1, a finite set of points in the plane, we define a sequence of point sets Si as follows: With Si already determined, let Li be the set of all the line segments connecting ...
Ansgar Grüne, Sanaz Kamali
COMGEO
2010
ACM
13 years 5 months ago
Pointed binary encompassing trees: Simple and optimal
For n disjoint line segments in the plane we construct in optimal O(n log n) time and linear space an encompassing tree of maximum degree three such that at every vertex all incid...
Michael Hoffmann, Bettina Speckmann, Csaba D. T&oa...
SWAT
2004
Springer
108views Algorithms» more  SWAT 2004»
13 years 10 months ago
Pointed Binary Encompassing Trees
For n disjoint line segments in the plane we can construct a binary encompassing tree such that every vertex is pointed, what’s more, at every segment endpoint all incident edges...
Michael Hoffmann, Bettina Speckmann, Csaba D. T&oa...
COMPGEOM
1991
ACM
13 years 8 months ago
Crossing Families
Given a set of points in the plane, a crossing family is a collection of line segments, each joining two of the points, such that any two line segments intersect internally. Two s...
Boris Aronov, Paul Erdös, Wayne Goddard, Dani...