2877 search results - page 20 / 576 » The Complexity of Planarity Testing |
ICIP
2004
IEEE
14 years 9 months ago
2004
IEEE
This paper presents a novel algorithm for 2D planar curve recognition based on B-Spline modeling. It combines the advantages of the B-Spline that are continuous curve representati...
COMGEO
2006
ACM
13 years 7 months ago
2006
ACM
Geometric shortest paths are a major topic in computational geometry; see the survey paper by Mitchell [12]. A shortest path between two points in a simple polygon can be found in...
CCCG
2008
13 years 9 months ago
2008
Curve matching is an important computational task for domains such as: reconstruction of archaeological fragments, forensics investigation, measuring melodic similarity, and model...
ECCC
2007
13 years 7 months ago
2007
Abstract. Motivated by a study of Zimand (22nd CCC, 2007), we consider the average-case complexity of property testing (focusing, for clarity, on testing properties of Boolean stri...
SEKE
2010
Springer
13 years 6 months ago
2010
Springer
—The behavior of complex production automation systems is hard to predict, therefore simulation is used to study the likely system behavior. However, in a real-world system many ...