Search Sciweavers | Sciweavers

We study the problem how to draw a planar graph such that every vertex is incident to an angle greater than π. In general a straightline embedding cannot guarantee this property....

Oswin Aichholzer, Günter Rote, André S...

claim paper

Read More »

144

click to vote

CCCG
2007

105views Computational Geometry» more CCCG 2007»

Exact and Approximate Geometric Pattern Matching for Point Sets in the Plane under Similarity Transformations

15 years 8 months ago

Download www.esiee.fr

Dror Aiger, Klara Kedem

claim paper

Read More »

161

Voted

CCCG
2008

66views Computational Geometry» more CCCG 2008»

Generalized Ham-Sandwich Cuts for Well Separated Point Sets

15 years 8 months ago

Sciweavers

Explore & Download

Productivity Tools

Sciweavers