Sciweavers

Share
6 search results - page 1 / 2
» Efficient on-line algorithms for Euler diagram region comput...
Sort
View
COMGEO
2011
ACM
8 years 1 months ago
Efficient on-line algorithms for Euler diagram region computation
Gennaro Cordasco, Rosario De Chiara, Andrew Fish
GD
2003
Springer
9 years 15 days ago
Drawing Area-Proportional Venn and Euler Diagrams
We consider the problem of drawing Venn diagrams for which each region’s area is proportional to some weight (e.g., population or percentage) assigned to that region. These area-...
Stirling Chow, Frank Ruskey
JPDC
2006
148views more  JPDC 2006»
8 years 7 months ago
Efficient algorithm for placing a given number of base stations to cover a convex region
In the context of mobile communication, an efficient algorithm for the base-station placement problem is developed in this paper. The objective is to place a given number of base-...
Gautam K. Das, Sandip Das, Subhas C. Nandy, Bhaban...
GIS
2004
ACM
9 years 8 months ago
Algorithms for the placement of diagrams on maps
This paper discusses a variety of ways to place diagrams like pie charts on maps, in particular, administrative subdivisions. The different ways come from different models of the ...
Étienne Schramm, Alexander Wolff, Marc J. v...
COMGEO
2004
ACM
8 years 7 months ago
The weighted farthest color Voronoi diagram on trees and graphs
Let n point sites be situated on the vertices or edges of a geometric graph G over e edges. Each site can be assigned a multiplicative weight and a color. We discuss the complexit...
Ferran Hurtado, Rolf Klein, Elmar Langetepe, Vera ...
books