2509 search results - page 87 / 502 » Abstract Geometrical Computation and Computable Analysis |
102
click to vote
SMA
2009
ACM
15 years 7 months ago
2009
ACM
Current mesh reduction techniques, while numerous, all primarily reduce mesh size by successive element deletion (e.g. edge collapses) with the goal of geometric and topological f...
89
Voted
DAC
2009
ACM
15 years 7 months ago
2009
ACM
In this paper we present a continuous surface model to describe the interconnect geometric variation, which improves the currently used model for better accuracy while not increas...
127
Voted
COMPGEOM
2010
ACM
15 years 5 months ago
2010
ACM
A graph is near-planar if it can be obtained from a planar graph by adding an edge. We show that it is NP-hard to compute the crossing number of near-planar graphs. The main idea ...
118
Voted
TOG
2008
15 years 18 days ago
2008
We introduce a computational framework for discovering regular or repeated geometric structures in 3D shapes. We describe and classify possible regular structures and present an e...
114
click to vote
BMCBI
2007
15 years 21 days ago
2007
Background: An accurate description of protein shape derived from protein structure is necessary to establish an understanding of protein-ligand interactions, which in turn will l...