4131 search results - page 347 / 827 » Compactness in Topology and Computation |
190
click to vote
IMR
2003
Springer
15 years 12 months ago
2003
Springer
This paper proposes a method for predicting the complexity of meshing Computer Aided Design (CAD) geometries with unstructured, hexahedral, finite elements. Meshing complexity ref...
197
click to vote
COMPGEOM
2010
ACM
15 years 11 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 ...
193
Voted
VISUALIZATION
2002
IEEE
15 years 11 months ago
2002
IEEE
Isosurfaces are commonly used to visualize scalar fields. Critical isovalues indicate isosurface topology changes: the creation of new surface components, merging of surface comp...
195
click to vote
PDP
2010
IEEE
15 years 11 months ago
2010
IEEE
The increasing numbers of cores, shared caches and memory nodes within machines introduces a complex hardware topology. High-performance computing applications now have to carefull...
181
click to vote
CGI
1999
IEEE
15 years 11 months ago
1999
IEEE
Existing data embedding algorithms for polygonal meshes and their attributes can't be applied to the majority of (geometric) computer aided design (CAD) applications, for two...