641 search results - page 65 / 129 » On Planar Quasi-Parity Graphs |
173
click to vote
TCS
2008
15 years 6 months ago
2008
This paper addresses the problem of representing the connectivity information of geometric objects using as little memory as possible. As opposed to raw compression issues, the fo...
149
click to vote
ICIP
2005
IEEE
16 years 7 months ago
2005
IEEE
This paper presents a technique to detect instances of classes (objects) according to their semantic definition in the form of a Description Graph. Classes are defined as combinat...
153
click to vote
COMBINATORICS
2002
15 years 6 months ago
2002
Suppose G is r-colorable and P V (G) is such that the components of G[P] are far apart. We show that any (r + s)-coloring of G[P] in which each component is s-colored extends to ...
119
click to vote
FOCS
2003
IEEE
15 years 11 months ago
2003
IEEE
We give a surprisingly short proof that in any planar arrangement of Ò curves where each pair intersects at most a fixed number (×) of times, the -level has subquadratic (Ç´...
137
click to vote
IMR
2003
Springer
15 years 11 months ago
2003
Springer
An “adaptive” variant of Ruppert’s Algorithm for producing quality triangular planar meshes is introduced. The algorithm terminates for arbitrary Planar Straight Line Graph ...