Sciweavers

1245 search results - page 40 / 249
» Triangulation for Points on Lines
Sort
View
DRR
2008
14 years 11 months ago
Robust line segmentation for handwritten documents
Line segmentation is the first and the most critical pre-processing step for a document recognition/analysis task. Complex handwritten documents with lines running into each other...
Kamal Kuzhinjedathu, Harish Srinivasan, Sargur N. ...
GRAPHICSINTERFACE
2009
14 years 7 months ago
Fast low-memory streaming MLS reconstruction of point-sampled surfaces
We present a simple and efficient method for reconstructing triangulated surfaces from massive oriented point sample datasets. The method combines streaming and parallelization, m...
Gianmauro Cuccuru, Enrico Gobbetti, Fabio Marton, ...
SWAT
2004
Springer
108views Algorithms» more  SWAT 2004»
15 years 3 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...
VISUALIZATION
2005
IEEE
15 years 3 months ago
HOT- Lines: Tracking Lines in Higher Order Tensor Fields
Tensors occur in many areas of science and engineering. Especially, they are used to describe charge, mass and energy transport (i.e. electrical conductivity tensor, diffusion ten...
Mario Hlawitschka, Gerik Scheuermann
CORR
1999
Springer
84views Education» more  CORR 1999»
14 years 9 months ago
Finding an ordinary conic and an ordinary hyperplane
Given a finite set of non-collinear points in the plane, there exists a line that passes through exactly two points. Such a line is called an ordinary line. An efficient algorithm...
Olivier Devillers, Asish Mukhopadhyay