Sciweavers

6 search results - page 1 / 2
» An Inscribing Model for Random Polytopes
Sort
View
DCG
2008
110views more  DCG 2008»
13 years 4 months ago
An Inscribing Model for Random Polytopes
For convex bodies K with C2 boundary in Rd, we explore random polytopes with vertices chosen along the boundary of K. In particular, we determine asymptotic properties of the volum...
Ross M. Richardson, Van H. Vu, Lei Wu
EJC
2007
13 years 4 months ago
Random inscribing polytopes
Ross M. Richardson, Van H. Vu, Lei Wu
ICCAD
1993
IEEE
101views Hardware» more  ICCAD 1993»
13 years 9 months ago
Convexity-based algorithms for design centering
A new technique for design centering, and for polytope approximation of the feasible region for a design are presented. In the rst phase, the feasible region is approximated by a ...
Sachin S. Sapatnekar, Pravin M. Vaidya, Steve M. K...
SMA
2010
ACM
171views Solid Modeling» more  SMA 2010»
13 years 5 months ago
Efficient simplex computation for fixture layout design
Designing a fixture layout of an object can be reduced to computing the largest simplex and the resulting simplex is classified using the radius of the largest inscribed ball cent...
Yu Zheng, Ming C. Lin, Dinesh Manocha
STOC
2001
ACM
116views Algorithms» more  STOC 2001»
14 years 5 months ago
One line and n points
: We analyze a randomized pivoting process involving one line and n points in the plane. The process models the behavior of the RANDOM-EDGE simplex algorithm on simple polytopes wi...
Bernd Gärtner, József Solymosi, Falk T...