Sciweavers

885 search results - page 46 / 177
» Optimal Polygon Placement
Sort
View
CCCG
2010
13 years 11 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, ...
ICCAD
2009
IEEE
98views Hardware» more  ICCAD 2009»
13 years 7 months ago
A rigorous framework for convergent net weighting schemes in timing-driven placement
We present a rigorous framework that defines a class of net weighting schemes in which unconstrained minimization is successively performed on a weighted objective. We show that, ...
Tony F. Chan, Jason Cong, Eric Radke
VMV
2004
150views Visualization» more  VMV 2004»
13 years 11 months ago
Hierarchical Shape-Adaptive Quantization for Geometry Compression
The compression of polygonal mesh geometry is still an active field of research as in 3d no theoretical bounds are known. This work proposes a geometry coding method based on pred...
Stefan Gumhold
KDD
2007
ACM
191views Data Mining» more  KDD 2007»
14 years 10 months ago
Cost-effective outbreak detection in networks
Given a water distribution network, where should we place sensors to quickly detect contaminants? Or, which blogs should we read to avoid missing important stories? These seemingl...
Andreas Krause, Carlos Guestrin, Christos Faloutso...
SAC
2005
ACM
14 years 3 months ago
Efficient placement and routing in grid-based networks
This paper presents an efficient technique for placement and routing of sensors/actuators and processing units in a grid network. Our system requires an extremely high level of ro...
Roozbeh Jafari, Foad Dabiri, Bo-Kyung Choi, Majid ...