Sciweavers

30 search results - page 4 / 6
» Matroid Polytopes and their Volumes
Sort
View
SAC
2010
ACM
14 years 25 days ago
Polytope-based computation of polynomial ranges
Polynomial ranges are commonly used for numerically solving polynomial systems with interval Newton solvers. Often ranges are computed using the convex hull property of the tensor...
Christoph Fünfzig, Dominique Michelucci, Sebt...
DCG
2006
82views more  DCG 2006»
13 years 6 months ago
Volume Computation for Polytopes and Partition Functions for Classical Root Systems
This paper presents an algorithm to compute the value of the inverse Laplace transforms of rational functions with poles on arrangements of hyperplanes. As an application, we prese...
M. Welleda Baldoni-Silva, Matthias Beck, Charles C...
TVCG
2008
119views more  TVCG 2008»
13 years 5 months ago
Velocity-Aligned Discrete Oriented Polytopes for Dynamic Collision Detection
Abstract-- We propose an acceleration scheme for dynamic collision detection at interactive rates. We use a tight bounding volume representation that offers fast update rates and t...
Daniel S. Coming, Oliver G. Staadt
DCG
2006
163views more  DCG 2006»
13 years 6 months ago
Isometry-Invariant Valuations on Hyperbolic Space
Abstract. Hyperbolic area is characterized as the unique continuous isometry invariant simple valuation on convex polygons in H2 . We then show that continuous isometry invariant s...
Daniel A. Klain
SODA
1993
ACM
119views Algorithms» more  SODA 1993»
13 years 7 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