339 search results - page 11 / 68 » Geometry of Graphs |
COCOA
2008
Springer
13 years 9 months ago
2008
Springer
Connected Vertex Cover Problem (CVC) is an NP-hard problem. The currently best known approximation algorithm for CVC has performance ration 2. This paper gives the first Polynomial...
SSD
2007
Springer
14 years 1 months ago
2007
Springer
The notion of a map is a fundamental metaphor in spatial disciplines. However, there currently exist no adequate data models for maps that define a precise spatial data type for m...
IMR
1998
Springer
13 years 12 months ago
1998
Springer
In this paper we introduce and discuss a graph structure associated with longest-edge algorithms (algorithms based on the bisection of triangles by the longest-edge) which can be u...
NIPS
2008
13 years 9 months ago
2008
Metal binding is important for the structural and functional characterization of proteins. Previous prediction efforts have only focused on bonding state, i.e. deciding which prot...
EUROGRAPHICS
2010
Eurographics
14 years 4 months ago
2010
Eurographics
Interpolating vertex positions among triangle meshes with identical vertex-edge graphs is a fundamental part of many geometric modelling systems. Linear vertex interpolation is ro...