Sciweavers

2843 search results - page 352 / 569
» Interpolation by geometric algorithm
Sort
View
APPROX
2004
Springer
113views Algorithms» more  APPROX 2004»
15 years 4 months ago
Computationally-Feasible Truthful Auctions for Convex Bundles
In many economic settings, convex figures on the plane are for sale. For example, one might want to sell advertising space on a newspaper page. Selfish agents must be motivated ...
Moshe Babaioff, Liad Blumrosen
SIGGRAPH
1999
ACM
15 years 3 months ago
Optimization of Mesh Locality for Transparent Vertex Caching
Bus traffic between the graphics subsystem and memory can become a bottleneck when rendering geometrically complex meshes. In this paper, we investigate the use of vertex caching...
Hugues Hoppe
APPROX
2008
Springer
83views Algorithms» more  APPROX 2008»
15 years 1 months ago
Sampling Hypersurfaces through Diffusion
Abstract. We are interested in efficient algorithms for generating random samples from geometric objects such as Riemannian manifolds. As a step in this direction, we consider the ...
Hariharan Narayanan, Partha Niyogi
WSCG
2004
145views more  WSCG 2004»
15 years 19 days ago
Efficient and Feature-Preserving Triangular Mesh Decimation
Most of the existing algorithms for decimation of triangular meshes perform poorly at very low levels of detail. We propose a new automatic method for the decimation of triangular...
Muhammad Hussain, Yoshihiro Okada, Koichi Niijima
GLOBECOM
2010
IEEE
14 years 8 months ago
Sensor Placement for Minimum Exposure in Distributed Active Sensing Networks
Distributed active sensing is a new sensing paradigm, where active sensors and passive sensors are distributed in a field, and collaboratively detect and track the objects. "E...
Na Xia, Khuong Vu, Rong Zheng