Sciweavers

346 search results - page 54 / 70
» Isodiametric Problems for Polygons
Sort
View
W2GIS
2004
Springer
14 years 22 days ago
Expansion-Based Algorithms for Finding Single Pair Shortest Path on Surface
Abstract. Finding single pair shortest paths on surface is a fundamental problem in various domains, like Geographic Information Systems (GIS) 3D applications, robotic path plannin...
Ke Deng, Xiaofang Zhou
CGVR
2006
13 years 8 months ago
Real-time Computation of Area Shadows - A Geometrical Algorithm
The computation of soft shadows created by area light sources is a well-known problem in computer graphics. Due to the complexity of the problem, soft shadows commonly are generat...
Michael Boehl, Wolfgang Stürzlinger
DAGSTUHL
1994
13 years 8 months ago
Competitive Strategies for Autonomous Systems
A strategy for working with incomplete information is called competitive if it solves each problem instance at a cost not exceeding the cost of an optimal solution (with full info...
Christian Icking, Rolf Klein
WSCG
2003
166views more  WSCG 2003»
13 years 8 months ago
View-Dependent Multiresolution Model For Foliage
Real-time rendering of vegetation is one of the most important challenges in outdoor scenes. This is due to the vast amount of polygons that are used to model vegetable species. M...
Inmaculada Remolar, Miguel Chover, José Rib...
ICCSA
2007
Springer
14 years 1 months ago
3D Spatial Operations in Geo DBMS Environment for 3D GIS
Next generation of GIS software should be able to manipulate and analyse complex situations of real world phenomena. One of the desired components in such software or system is the...
Chen Tet-Khuan, Alias Abdul-Rahman, Sisi Zlatanova