Sciweavers

584 search results - page 55 / 117
» On the Number of Halving Planes
Sort
View
CAINE
2003
14 years 11 months ago
Semi Greedy Algorithm for Finding Connectivity in Microchip Physical Layouts
Scan based or Line Sweep methods are a traditional mechanism to traverse the physical layout, or artwork of a microchip. These traversals are incremental in nature. They typically...
Clemente Izurieta
SODA
1993
ACM
119views Algorithms» more  SODA 1993»
14 years 11 months ago
Iterated Nearest Neighbors and Finding Minimal Polytopes
We introduce a new method for nding several types of optimal k-point sets, minimizing perimeter, diameter, circumradius, and related measures, by testing sets of the O(k) nearest ...
David Eppstein, Jeff Erickson
APPML
2007
58views more  APPML 2007»
14 years 10 months ago
A class of exactly solvable free-boundary inhomogeneous porous medium flows
We describe a class of inhomogeneous two-dimensional porous medium flows, driven by a finite number of multipole sources; the free boundary dynamics can be parametrized by polyn...
Sam D. Howison, Igor Loutsenko, John R. Ockendon
CORR
2008
Springer
141views Education» more  CORR 2008»
14 years 10 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...
IJRR
2008
75views more  IJRR 2008»
14 years 10 months ago
Planning Time-Minimal Safe Paths Amidst Unpredictably Moving Obstacles
In this paper we discuss the problem of planning safe paths amidst unpredictably moving obstacles in the plane. Given the initial positions and the maximum speeds of the moving ob...
Jur P. van den Berg, Mark H. Overmars