Sciweavers

279 search results - page 31 / 56
» Implicit Convex Polygons
Sort
View
CCCG
2010
13 years 9 months ago
Sweeping minimum perimeter enclosing parallelograms: Optimal crumb cleanup
We examine the problem of pushing all the points of a planar region into one point using parallel sweeps of an infinite line, minimizing the sum of the lengths of the sweep vector...
Yonit Bousany, Mary Leah Karker, Joseph O'Rourke, ...
EJC
2008
13 years 7 months ago
A simple proof for open cups and caps
Let X be a set of points in general position in the plane. General position means that no three points lie on a line and no two points have the same x-coordinate. Y X is a cup, r...
Jakub Cerný
CGF
2002
110views more  CGF 2002»
13 years 7 months ago
Free-form sketching with variational implicit surfaces
With the advent of sketch-based methods for shape construction, there's a new degree of power available in the rapid creation of approximate shapes. Sketch [Zeleznik, 1996] s...
Olga A. Karpenko, John F. Hughes, Ramesh Raskar
ALGOSENSORS
2008
Springer
13 years 9 months ago
Simple Robots in Polygonal Environments: A Hierarchy
With the current progress in robot technology and related areas, sophisticated moving and sensing capabilities are at hand to design robots capable of solving seemingly complex tas...
Jan Brunner, Matús Mihalák, Subhash ...
MP
2006
84views more  MP 2006»
13 years 7 months ago
On the behavior of the homogeneous self-dual model for conic convex optimization
Abstract. There is a natural norm associated with a starting point of the homogeneous selfdual (HSD) embedding model for conic convex optimization. In this norm two measures of the...
Robert M. Freund