74 search results - page 10 / 15 » Trapezoid Graphs and Generalizations, Geometry and Algorithm... |
COMPGEOM
2010
ACM
13 years 11 months ago
2010
ACM
The best known upper bound on the number of topological changes in the Delaunay triangulation of a set of moving points in R2 is (nearly) cubic, even if each point is moving with ...
COMPGEOM
2005
ACM
13 years 8 months ago
2005
ACM
We present an efficient algorithm for maintaining the boundary and surface area of protein molecules as they undergo conformational changes. We also describe a robust implementati...
SGP
2007
13 years 9 months ago
2007
We present two new Delaunay refinement algorithms, second an extension of the first. For a given input domain (a set of points or a planar straight line graph), and a threshold an...
PUK
2003
13 years 8 months ago
2003
This paper exploits the spatial representation of state space problem graphs to preprocess and enhance heuristic search engines. It combines classical AI exploration with computati...
DAC
2005
ACM
13 years 8 months ago
2005
ACM
Layout parasitics have great impact on analog circuit performance. This paper presents an algorithm for explicit parasitic control during layout retargeting of analog integrated c...