833 search results - page 47 / 167 » Geometric Optimization |
COMPGEOM
2004
ACM
14 years 1 months ago
2004
ACM
Let B be a set of n unit balls in R3 . We show that the combinatorial complexity of the space of lines in R3 that avoid all the balls of B is O(n3+ε ), for any ε > 0. This re...
ICCD
2006
IEEE
14 years 4 months ago
2006
IEEE
— New back-end design for manufacturability rules have brought guarantee rules for interconnect matching. These rules indicate a certain capacitance matching guarantee given spac...
CAD
2007
Springer
13 years 7 months ago
2007
Springer
This paper presents a global optimization operator for arbitrary meshes. The global optimization operator is composed of two main terms, one part is the global Laplacian operator ...
WABI
2001
Springer
14 years 1 days ago
2001
Springer
We derive a branch-and-bound algorithm to find an optimal inversion median of three signed permutations. The algorithm prunes to manageable size an extremely large search tree usi...
COMPGEOM
2006
ACM
14 years 1 months ago
2006
ACM
This paper addresses the problem of representing the connectivity information of geometric objects using as little memory as possible. As opposed to raw compression issues, the fo...