60 search results - page 12 / 12 » A Polynomial Bound for Untangling Geometric Planar Graphs |
CVPR
2007
IEEE
13 years 11 months ago
2007
IEEE
Energy-minimizing active contour models (snakes) have been proposed for solving many computer vision problems such as object segmentation, surface reconstruction, and object track...
COMPGEOM
2010
ACM
13 years 10 months ago
2010
ACM
The best known upper bound on the number of topological changes in the Delaunay triangulation of a set of moving points in R2 is (nearly) cubic, even if each point is moving with ...
IWDC
2005
Springer
13 years 10 months ago
2005
Springer
This paper deals with compact label-based representations for trees. Consider an n-node undirected connected graph G with a predefined numbering on the ports of each node. The al...
COMPGEOM
2010
ACM
13 years 10 months ago
2010
ACM
We study the expected number of interior vertices of degree i in a triangulation of a point set S, drawn uniformly at random from the set of all triangulations of S, and derive va...
CPM
2004
Springer
13 years 10 months ago
2004
Springer
In this paper we investigate the protein sequence design (PSD) problem (also known as the inverse protein folding problem) under the Canonical model 4 on 2D and 3D lattices [12, 25...