Sciweavers

21 search results - page 3 / 5
» On point covers of c-oriented polygons
Sort
View
WADS
2009
Springer
274views Algorithms» more  WADS 2009»
15 years 2 months ago
New Results on Visibility in Simple Polygons
We show that (A), 14 points on the boundary of a Jordan curve, and (B), 16 points in convex position encircled by a Jordan curve, cannot be shattered by interior visibility domains...
Alexander Gilbers, Rolf Klein
JGTOOLS
2007
119views more  JGTOOLS 2007»
14 years 9 months ago
PB-FFD: A Point-Based Technique for Free-Form Deformation
This paper presents PB-FFD, a novel, interactive, point-based technique for performing free-form deformation of polygonal meshes. First, a volumetric deformation space is de ned a...
Kevin T. McDonnell, Hong Qin
CCECE
2011
IEEE
13 years 9 months ago
An algorithm for object tracking based on adaptive triangle shape mesh estimation method
— Although "Adaptive Mesh" is regarded as complicating method for object tracking accompanied with many controversies and obstacles, but it has been proposed that such ...
Mahdi Koohi, Mahdi Narghi, Abbas Shakery
WWW
2010
ACM
15 years 1 months ago
Hierarchical cluster visualization in web mapping systems
This paper presents a technique for visualizing large spatial data sets in Web Mapping Systems (WMS). The technique creates a hierarchical clustering tree, which is subsequently u...
Jean-Yves Delort
IJCGA
2000
85views more  IJCGA 2000»
14 years 9 months ago
Obnoxious Facility Location: Complete Service with Minimal Harm
We present e cient algorithms for several instances of the following facility location problem. Facilities and demand sites are represented as points in the plane. Place k obnoxio...
Boaz Ben-Moshe, Matthew J. Katz, Michael Segal