102291 search results - page 62 / 20459 » Computability in Computational Geometry |
132
click to vote
COMPGEOM
2007
ACM
15 years 8 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...
135
click to vote
DGCI
2009
Springer
15 years 7 months ago
2009
Springer
The Minimum Length Polygon (MLP) is an interesting first order approximation of a digital contour. For instance, the convexity of the MLP is characteristic of the digital convexit...
133
click to vote
CG
2005
Springer
15 years 4 months ago
2005
Springer
Early in the development of Computer Graphics it was realized that projective geometry was well suited for the representation of transformations. Now, it seems that another change...
155
click to vote
Presentation
Geometry of Graphs. Talk on celebrated LLR Paper, (November 2006)
