40 search results - page 4 / 8 » Efficient query processing on unstructured tetrahedral meshe... |
EDBT
2009
ACM
15 years 1 months ago
2009
ACM
Many websites with a large user base, e.g., websites of nonprofit organizations, do not have the financial means to install large web-servers or use specialized content distributi...
CGF
2008
14 years 9 months ago
2008
Given a 3D solid model S represented by a tetrahedral mesh, we describe a novel algorithm to compute a hierarchy of convex polyhedra that tightly enclose S. The hierarchy can be b...
89
Voted
CCCG
2008
14 years 11 months ago
2008
We are interested in the following mesh refinement problem: given an input set of points P in Rd , we would like to produce a good-quality triangulation by adding new points in P....
DBISP2P
2006
Springer
15 years 1 months ago
2006
Springer
The processing of k-NN queries has been studied extensively both in a centralized computing environment and in a structured P2P environment. However, the problem over an unstructur...
IMR
1999
Springer
15 years 1 months ago
1999
Springer
The primary focus of this project is to design and implement a parallel framework for an unstructured mesh generator based on the advancing front method (AFM). In particular, we t...