Sciweavers

43 search results - page 2 / 9
» Treemaps with Bounded Aspect Ratio
Sort
View
WADS
2005
Springer
149views Algorithms» more  WADS 2005»
13 years 10 months ago
Balanced Aspect Ratio Trees Revisited
Spatial databases support a variety of geometric queries on point data such as range searches, nearest neighbor searches, etc. Balanced Aspect Ratio (BAR) trees are hierarchical sp...
Amitabh Chaudhary, Michael T. Goodrich
SODA
1997
ACM
98views Algorithms» more  SODA 1997»
13 years 6 months ago
Optimal Good-Aspect-Ratio Coarsening for Unstructured Meshes
A hierarchical gradient of an unstructured mesh M0 is a sequence of meshes M1;...;Mk such that jMkj is smaller than a given threshold mesh size b. The gradient is well-conditioned...
Gary L. Miller, Dafna Talmor, Shang-Hua Teng
GD
1998
Springer
13 years 9 months ago
Balanced Aspect Ratio Trees and Their Use for Drawing Very Large Graphs
We describe a new approach for cluster-based drawing of very large graphs, which obtains clusters by using binary space partition (BSP) trees. We also introduce a novel BSP-type de...
Christian A. Duncan, Michael T. Goodrich, Stephen ...
CEC
2009
IEEE
14 years 2 days ago
Towards an evolved lower bound for the most circular partition of a square
— We examine the problem of partitioning a square into convex polygons which are as circular as possible. Circular means that the polygon’s aspect ratio is supposed to be near
Claudia Obermaier, Markus Wagner
COMGEO
2006
ACM
13 years 5 months ago
On the sizes of Delaunay meshes
Let P be a polyhedral domain occupying a convex volume. We prove that the size of a graded mesh of P with bounded vertex degree is within a factor O(H3 P ) of the size of any Dela...
Siu-Wing Cheng