736 search results - page 94 / 148 » Distinguishing geometric graphs |
109
click to vote
PROCEDIA
2010
14 years 10 months ago
2010
High quality meshes are crucial for the solution of partial differential equations (PDEs) via the finite element method (or other PDE solvers). The accuracy of the PDE solution,...
138
click to vote
COMPGEOM
2010
ACM
15 years 5 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 ...
103
click to vote
PAMI
2010
14 years 10 months ago
2010
— In the last decade, graph-cut optimization has been popular for a variety of labeling problems. Typically graph-cut methods are used to incorporate smoothness constraints on a ...
109
click to vote
ISAAC
2004
Springer
15 years 5 months ago
2004
Springer
For c ∈ R, a c-spanner is a subgraph of a complete Euclidean graph satisfying that between any two vertices there exists a path of weighted length at most c times their geometric...
JOIN
2007
14 years 11 months ago
2007
This paper is devoted to the following incremental problem. Initially, a graph and a distinguished subset of vertices, called initial group, are given. This group is connected by ...