885 search results - page 11 / 177 » Optimal Polygon Placement |
ASPDAC
1999
ACM
14 years 29 days ago
1999
ACM
We study a type of linear placement problem arising in detailed placement optimization of a given cell row in the presence of white-space (extra sites). In this single-row placeme...
EH
2004
IEEE
14 years 11 days ago
2004
IEEE
Field programmable gate arrays (FPGAs) are becoming increasingly important implementation platforms for digital circuits. One of the necessary requirements to effectively utilize ...
FAW
2008
Springer
13 years 10 months ago
2008
Springer
Abstract. We study a constrained version of the shortest path problem in polygonal domains, in which the path must visit a given target polygon. We provide an efficient algorithm f...
TVCG
2002
13 years 8 months ago
2002
Implicit surfaces are used for a number of tasks in computer graphics, including modeling soft or organic objects, morphing, collision detection, and constructive solid geometry. A...
SIGGRAPH
2000
ACM
14 years 6 days ago
2000
ACM
We present an algorithm for out-of-core simplification of large polygonal datasets that are too complex to fit in main memory. The algorithm extends the vertex clustering scheme o...