Search Sciweavers | Sciweavers

138 search results - page 7 / 28

» K-Guarding Polygons on the Plane

click to vote

JDA
2010

131views more JDA 2010»

Convex drawings of hierarchical planar graphs and clustered planar graphs

13 years 6 months ago

Download www.amp.i.kyoto-u.ac.jp

: Hierarchical graphs are graphs with layering structures; clustered graphs are graphs with recursive clustering structures. Both have applications in VLSI design, CASE tools, soft...

Seok-Hee Hong, Hiroshi Nagamochi

claim paper

Read More »

click to vote

COMPGEOM
1991
ACM

158views Discrete Geometry» more COMPGEOM 1991»

Polynomial-Size Nonobtuse Triangulation of Polygons

13 years 11 months ago

Download www.ics.uci.edu

We describe methods for triangulating polygonal regions of the plane so that no triangle has a large angle. Our main result is that a polygon with n sides can be triangulated with...

Marshall W. Bern, David Eppstein

claim paper

Read More »

click to vote

DM
2010

135views more DM 2010»

On convexification of polygons by pops

13 years 7 months ago

Download www.cs.uwm.edu

Given a polygon P in the plane, a pop operation is the reflection of a vertex with respect to the line through its adjacent vertices. We define a family of alternating polygons, a...

Adrian Dumitrescu, Evan Hilscher

claim paper

Read More »

click to vote

CCCG
1994

77views Computational Geometry» more CCCG 1994»

K-Guarding Polygons on the Plane

13 years 9 months ago

Download www.matem.unam.mx

Patrice Belleville, Prosenjit Bose, Jurek Czyzowic...

claim paper

Read More »