Reconstruction of concurrent lines from leaning points

Authors:
Peter Veelaert;Michaël Heyvaert
Affiliations:
University College Ghent, Engineering Sciences - Ghent University, Ghent, Belgium;University College Ghent, Engineering Sciences - Ghent University, Ghent, Belgium
Venue:
IWCIA'11 Proceedings of the 14th international conference on Combinatorial image analysis
Year:
2011

Citing 7
Cited 1

SKETCH: an interface for sketching 3D scenes

SIGGRAPH '96 Proceedings of the 23rd annual conference on Computer graphics and interactive techniques
Concurrency of Line Segments in Uncertain Geometry

DGCI '02 Proceedings of the 10th International Conference on Discrete Geometry for Computer Imagery
Graph-theoretical properties of parallelism in the digital plane

Discrete Applied Mathematics
Sketched Symbol Recognition using Zernike Moments

ICPR '04 Proceedings of the Pattern Recognition, 17th International Conference on (ICPR'04) Volume 1 - Volume 01
LADDER, a sketching language for user interface developers

Computers and Graphics
Combining geometry and domain knowledge to interpret hand-drawn diagrams

Computers and Graphics
A visual approach to sketched symbol recognition

IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence

Concurrency relations between digital planes

DGCI'13 Proceedings of the 17th IAPR international conference on Discrete Geometry for Computer Imagery

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we formulate an alternative approach to the sketch recognition problem. The figure to be recognized from a sketch is specified as a set of geometric line relationship rules. This approach normally has a high computational cost as it essentially is a non-linear optimization problem. We show that for some cases this cost can be avoided by approaching the geometric relationships testing as a ruler construction. In this paper we formulate the recognition problem and consider the construction of line concurrency relationships in detail. We show that the ruler construction is always possible for non-cyclic concurrency relations.