1879 search results - page 8 / 376 » Computational geometry algorithms library |
104
Voted
COMPGEOM
2003
ACM
15 years 6 months ago
2003
ACM
We develop algorithms for computing the smallest enclosing ball of a set of n balls in d-dimensional space. Unlike previous methods, we explicitly address small cases (n ≤ d + 1...
114
click to vote
DAGSTUHL
2003
15 years 2 months ago
2003
In this paper we discuss reliable methods in the field of finite precision geometry. We begin with a brief survey of geometric computing and approaches generally used in dealing ...
109
Voted
PG
2002
IEEE
15 years 5 months ago
2002
IEEE
We present an algorithm for computing the distance between two free-form surfaces. Using line geometry, the distance computation is reformulated as a simple instance of a surface-...
82
Voted
ICCAD
2005
IEEE
15 years 9 months ago
2005
IEEE
Placement migration is a critical step to address a variety of postplacement design closure issues, such as timing, routing congestion, signal integrity, and heat distribution. To...
114
Voted
COMPGEOM
2001
ACM
15 years 4 months ago
2001
ACM
This presentation illustrates examples of my geometric sculpture and outlines certain design techniques. I apply methods from the field of computational geometry to the creation o...