52 search results - page 9 / 11 » Decomposing a simple polygon into pseudo-triangles and conve... |
ICNC
2005
Springer
14 years 1 months ago
2005
Springer
This paper proposes an improved genetic algorithm for producing aesthetically pleasing drawings of general undirected graphs. Previous undirected graph drawing algorithms draw larg...
ISAAC
2007
Springer
14 years 1 months ago
2007
Springer
We solve several fundamental geometric problems under a new streaming model recently proposed by Ruhl et al. [2, 12]. In this model, in one pass the input stream can be scanned to ...
ACIVS
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. In this work we introduce a new technique for a frequently encountered problem in computer vision: image registration. The registration is computed by matching features, ...
ALGORITHMICA
1998
13 years 7 months ago
1998
Abstract. We study some minimum-area hull problems that generalize the notion of convex hull to starshaped and monotone hulls. Specifically, we consider the minimum-area star-shap...
IJRR
2002
13 years 7 months ago
2002
We present kinetic data structures for detecting collisions between a set of polygons that are moving continuously. Unlike classical collision detection methods that rely on bound...