Sciweavers

665 search results - page 23 / 133
» Algorithms for Triangulated Terrains
Sort
View
ICCS
2003
Springer
15 years 2 months ago
Approximation Algorithms to Minimum Vertex Cover Problems on Polygons and Terrains
We propose an anytime algorithm to compute successively better approximations of the optimum of Minimum Vertex Guard. Though the presentation is focused on polygons, the work may b...
Ana Paula Tomás, António Leslie Baju...
IPPS
1998
IEEE
15 years 1 months ago
An Improved Output-Size Sensitive Parallel Algorithm for Hidden-Surface Removal for Terrains
We describe an efficient parallel algorithm for hiddensurface removal for terrain maps. The algorithm runs in Olog4 n steps on the CREW PRAM model with a work bound of On + kpolyl...
Neelima Gupta, Sandeep Sen
COMGEO
2010
ACM
14 years 9 months ago
An efficient algorithm for the stratification and triangulation of an algebraic surface
: We present a method to compute the exact topology of a real algebraic surface S, implicitly given by a polynomial f Q[x,y,z] of arbitrary total degree N. Additionally, our analy...
Eric Berberich, Michael Kerber, Michael Sagraloff
CSSE
2008
IEEE
15 years 4 months ago
Diagonal-Flip Distance Algorithms of Three Type Triangulations
Deqiang Wang, Xian Wang, Shaoxi Li, Shaofang Zhang