Sciweavers

665 search results - page 86 / 133
» Algorithms for Triangulated Terrains
Sort
View
COMPGEOM
2003
ACM
15 years 3 months ago
Incremental constructions con BRIO
Randomized incremental constructions are widely used in computational geometry, but they perform very badly on large data because of their inherently random memory access patterns...
Nina Amenta, Sunghee Choi, Günter Rote
COMPGEOM
1998
ACM
15 years 2 months ago
Matching 2D Patterns of Protein Spots
A new algorithmic approach to comparing 2D patterns of protein spots obtained by the 2D gel electrophoresis technique is presented. Both the matching of a local pattern vs. a full...
Frank Hoffmann, Klaus Kriegel, Carola Wenk
ESA
2000
Springer
110views Algorithms» more  ESA 2000»
15 years 1 months ago
Polygon Decomposition for Efficient Construction of Minkowski Sums
Several algorithms for computing the Minkowski sum of two polygons in the plane begin by decomposing each polygon into convex subpolygons. We examine different methods for decompo...
Pankaj K. Agarwal, Eyal Flato, Dan Halperin
TVCG
2008
128views more  TVCG 2008»
14 years 9 months ago
AD-Frustum: Adaptive Frustum Tracing for Interactive Sound Propagation
We present an interactive algorithm to compute sound propagation paths for transmission, specular reflection and edge diffraction in complex scenes. Our formulation uses an adaptiv...
Anish Chandak, Christian Lauterbach, Micah T. Tayl...
ICDCS
2010
IEEE
15 years 1 months ago
Localized Algorithm for Precise Boundary Detection in 3D Wireless Networks
—This research focuses on distributed and localized algorithms for precise boundary detection in 3D wireless networks. Our objectives are in two folds. First, we aim to identify ...
Hongyu Zhou, Su Xia, Miao Jin, Hongyi Wu