Sciweavers

2980 search results - page 575 / 596
» Computational Geometry
Sort
View
FOCS
2007
IEEE
15 years 9 months ago
On the Hardness and Smoothed Complexity of Quasi-Concave Minimization
In this paper, we resolve the smoothed and approximative complexity of low-rank quasi-concave minimization, providing both upper and lower bounds. As an upper bound, we provide th...
Jonathan A. Kelner, Evdokia Nikolova
CIS
2008
Springer
15 years 9 months ago
Multiperspective Modeling and Rendering Using General Linear Cameras
We present a General Linear Camera (GLC) model that unifies many previous camera models into a single representation. The GLC model is capable of describing all perspective (pinhol...
Jingyi Yu, Yuanyuan Ding, and Leonard McMillan
COMPGEOM
2006
ACM
15 years 9 months ago
A fast k-means implementation using coresets
In this paper we develop an efficient implementation for a k-means clustering algorithm. The novel feature of our algorithm is that it uses coresets to speed up the algorithm. A ...
Gereon Frahling, Christian Sohler
VRCAI
2006
ACM
15 years 9 months ago
Parallel-split shadow maps for large-scale virtual environments
Shadowing effects dramatically enhance the realism of virtual environments by providing useful visual cues. Shadow mapping is an efficient algorithm for real-time shadow renderin...
Fan Zhang, Hanqiu Sun, Leilei Xu, Lee Kit Lun
MOBICOM
2005
ACM
15 years 8 months ago
MAP: medial axis based geometric routing in sensor networks
One of the challenging tasks in the deployment of dense wireless networks (like sensor networks) is in devising a routing scheme for node to node communication. Important consider...
Jehoshua Bruck, Jie Gao, Anxiao Jiang