Sciweavers

21 search results - page 4 / 5
» Integer representations of convex polygon intersection graph...
Sort
View
CORR
2008
Springer
141views Education» more  CORR 2008»
13 years 7 months ago
Obfuscated Drawings of Planar Graphs
Given a planar graph G, we consider drawings of G in the plane where edges are represented by straight line segments (which possibly intersect). Such a drawing is specified by an i...
Mihyun Kang, Oleg Pikhurko, Alexander Ravsky, Math...
COCOON
2003
Springer
14 years 23 days 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. ...
SWAT
1998
Springer
110views Algorithms» more  SWAT 1998»
13 years 11 months ago
On the Number of Regular Vertices of the Union of Jordan Regions
Let C be a collection of n Jordan regions in the plane in general position, such that each pair of their boundaries intersect in at most s points, where s is a constant. Let U den...
Boris Aronov, Alon Efrat, Dan Halperin, Micha Shar...
DCG
2006
163views more  DCG 2006»
13 years 7 months ago
Isometry-Invariant Valuations on Hyperbolic Space
Abstract. Hyperbolic area is characterized as the unique continuous isometry invariant simple valuation on convex polygons in H2 . We then show that continuous isometry invariant s...
Daniel A. Klain
GMP
2010
IEEE
190views Solid Modeling» more  GMP 2010»
14 years 11 days ago
A Subdivision Approach to Planar Semi-algebraic Sets
Abstract. Semi-algebraic sets occur naturally when dealing with implicit models and boolean operations between them. In this work we present an algorithm to efficiently and in a ce...
Angelos Mantzaflaris, Bernard Mourrain