Sciweavers

137 search results - page 19 / 28
» On polygons excluding point sets
Sort
View
JCO
2010
169views more  JCO 2010»
13 years 5 months ago
An almost four-approximation algorithm for maximum weight triangulation
We consider the following planar maximum weight triangulation (MAT) problem: given a set of n points in the plane, find a triangulation such that the total length of edges in tria...
Shiyan Hu
WWW
2010
ACM
13 years 11 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
COMPGEOM
2007
ACM
13 years 11 months ago
Streaming algorithms for line simplification
We study the following variant of the well-known line-simplification problem: we are getting a possibly infinite sequence of points p0, p1, p2, . . . in the plane defining a polyg...
Mohammad Ali Abam, Mark de Berg, Peter Hachenberge...
FOCS
2002
IEEE
14 years 9 days ago
Optimal System of Loops on an Orientable Surface
Every compact orientable boundaryless surface M can be cut along simple loops with a common point v0, pairwise disjoint except at v0, so that the resulting surface is a topologica...
Éric Colin de Verdière, Francis Laza...
VISUALIZATION
2002
IEEE
14 years 8 days ago
Interactive Visualization of Complex Plant Ecosystems
We present a method for interactive rendering of large outdoor scenes. Complex polygonal plant models and whole plant populations are represented by relatively small sets of point...
Oliver Deussen, Carsten Colditz, Marc Stamminger, ...