450 search results - page 46 / 90 » Quadrangulations of Planar Sets |
146
click to vote
SIAMDM
2008
15 years 6 months ago
2008
The first-fit chromatic number of a graph is the number of colors needed in the worst case of a greedy coloring. It is also called the Grundy number, which is defined to be the max...
192
click to vote
CCCG
2009
15 years 7 months ago
2009
In this paper we study the problem of computing an upward straight-line embedding of a directed graph G into a point set S, i.e. a planar drawing of G such that each vertex is map...
163
click to vote
JDA
2010
15 years 4 months ago
2010
We introduce and analyze σ-local graphs, based on a definition of locality by Erickson [12]. We present two algorithms to construct such graphs, for any real number σ > 1 an...
147
click to vote
ICPR
2006
IEEE
16 years 7 months ago
2006
IEEE
A method is proposed for performing shape analysis of m-surfaces, e.g. planar curves and surfaces, with a geometric interpretation. The analysis uses an implicit surface represent...
182
click to vote
ECCV
2010
Springer
15 years 6 months ago
2010
Springer
This paper presents a new method for 2-D and 3-D shape retrieval based on geodesic signatures. These signatures are high dimensional statistical distributions computed by extractin...