Sciweavers

346 search results - page 36 / 70
» Isodiametric Problems for Polygons
Sort
View
INFOVIS
2005
IEEE
14 years 3 months ago
Voronoi Treemaps
Treemaps are a well-known method for the visualization of attributed hierarchical data. Previously proposed Treemap layout algorithms are limited to rectangular shapes, which caus...
Michael Balzer, Oliver Deussen
JCDCG
2004
Springer
14 years 3 months ago
Farthest-Point Queries with Geometric and Combinatorial Constraints
In this paper we discuss farthest-point problems in which a set or sequence S of n points in the plane is given in advance and can be preprocessed to answer various queries efficie...
Ovidiu Daescu, Ningfang Mi, Chan-Su Shin, Alexande...
IJCGA
2000
85views more  IJCGA 2000»
13 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
SI3D
1995
ACM
14 years 1 months ago
The Sort-First Rendering Architecture for High-Performance Graphics
Interactive graphics applications have long been challenging graphics system designers by demanding machines that can provide ever increasing polygon rendering performance. Anothe...
Carl Mueller
AAAI
2007
14 years 4 days ago
Simple Robots with Minimal Sensing: From Local Visibility to Global Geometry
We consider problems of geometric exploration and selfdeployment for simple robots that can only sense the combinatorial (non-metric) features of their surroundings. Even with suc...
Subhash Suri, Elias Vicari, Peter Widmayer