2877 search results - page 80 / 576 » The Complexity of Planarity Testing |
102
Voted
CAD
2008
Springer
15 years 4 months ago
2008
Springer
We present several algorithms for self-intersection detection, and possible elimination, in freeform planar curves and surfaces. Both local and global self-intersections are elimi...
120
click to vote
JGAA
2008
15 years 3 months ago
2008
Let G be a bipartite graph, and let e, i be two parallel convex curves; we study the question about whether G admits a planar straight-line drawing such that the vertices of one p...
150
click to vote
BMVC
2010
15 years 1 months ago
2010
This paper deals with the problem of estimating structure of 3D scenes and image transformations from observations that are blurred due to unconstrained camera motion. Initially, ...
146
Voted
ICALP
2009
Springer
16 years 4 months ago
2009
Springer
Abstract. We propose the study of graphs that are defined by lowcomplexity distributed and deterministic agents. We suggest that this viewpoint may help introduce the element of in...
121
click to vote
NLDB
2007
Springer
15 years 10 months ago
2007
Springer
In this paper, we propose methods and heuristics having high accuracies and low time complexities for filtering spam e-mails. The methods are based on the n-gram approach and a heu...