Sciweavers

17 search results - page 2 / 4
» Polygon Properties Calculated from the Vertex Neighborhoods
Sort
View
ICALP
2011
Springer
12 years 8 months ago
Vertex Cover in Graphs with Locally Few Colors
In [13], Erd˝os et al. defined the local chromatic number of a graph as the minimum number of colors that must appear within distance 1 of a vertex. For any ∆ ≥ 2, there are ...
Fabian Kuhn, Monaldo Mastrolilli
ISAAC
2010
Springer
230views Algorithms» more  ISAAC 2010»
13 years 2 months ago
Seidel Minor, Permutation Graphs and Combinatorial Properties
A permutation graph is an intersection graph of segments lying between two parallel lines. A Seidel complementation of a finite graph at a vertex v consists in complementing the ed...
Vincent Limouzy
VISUALIZATION
2002
IEEE
13 years 9 months ago
Exploring Surface Characteristics with Interactive Gaussian Images (A Case Study)
The Gauss map projects surface normals to a unit sphere, providing a powerful visualization of the geometry of a graphical object. It can be used to predict visual events caused b...
Bradley C. Lowekamp, Penny Rheingans, Terry S. Yoo
SMI
2003
IEEE
223views Image Analysis» more  SMI 2003»
13 years 10 months ago
Skeleton Extraction of 3D Objects with Radial Basis Functions
Skeleton is a lower dimensional shape description of an object. The requirements of a skeleton differ with applications. For example, object recognition requires skeletons with pr...
Wan-Chun Ma, Fu-Che Wu, Ming Ouhyoung
COCOON
2003
Springer
13 years 10 months ago
On a Conjecture on Wiener Indices in Combinatorial Chemistry
Drugs and other chemical compounds are often modeled as polygonal shapes, where each vertex represents an atom of the molecule, and covalent bonds between atoms are represented by...
Yih-En Andrew Ban, Sergei Bespamyatnikh, Nabil H. ...