99 search results - page 14 / 20 » On empty convex polygons in a planar point set |
170
click to vote
CGI
2004
IEEE
15 years 10 months ago
2004
IEEE
An Origamic Architecture (OA) is a folded sheet of perforated paper from which a three-dimensional structure "pops up" when it is opened. It is similar to a "pop-up...
197
click to vote
ENDM
2008
15 years 6 months ago
2008
In this paper we study some connectivity augmentation problems. Given a connected graph G with some desirable property, we want to make G 2-vertex connected (or 2-edge connected) ...
171
click to vote
WADS
2005
Springer
16 years 4 days ago
2005
Springer
Let G be an embedded planar graph whose edges may be curves. The detour between two points, p and q (on edges or vertices) of G, is the ratio between the shortest path in G between...
154
click to vote
ISAAC
2005
Springer
16 years 5 days ago
2005
Springer
Given a set S of n points in RD , and an integer k such that 0 k < n, we show that a geometric graph with vertex set S, at most n − 1 + k edges, maximum degree five, and dila...
140
click to vote
ISAAC
2004
Springer
16 years 1 days ago
2004
Springer
In the Paired Pointset Traversal problem we ask whether, given two sets A = {a1, . . . , an} and B = {b1, . . . , bn} in the plane, there is an ordering π of the points such that ...