Sciweavers

346 search results - page 66 / 70
» Isodiametric Problems for Polygons
Sort
View
ANLP
1994
73views more  ANLP 1994»
13 years 8 months ago
Understanding Location Descriptions in the LEI System
Biological specimens have historicallybeen labeled with English descriptions of the location of collection. To perform spatial, statistical, or historic studies, these description...
David N. Chin, Matthew McGranaghan, Tung-Tse Chen
APVIS
2009
13 years 8 months ago
A self-adaptive treemap-based technique for visualizing hierarchical data in 3D
In this paper, we present a novel adaptive visualization technique where the constituting polygons dynamically change their geometry and other visual attributes depending on user ...
Abon Chaudhuri, Han-Wei Shen
ADCM
2007
134views more  ADCM 2007»
13 years 7 months ago
Barycentric coordinates for convex sets
In this paper we provide an extension of barycentric coordinates from simplices to arbitrary convex sets. Barycentric coordinates over convex 2D polygons have found numerous appli...
Joe D. Warren, Scott Schaefer, Anil N. Hirani, Mat...
CAD
2008
Springer
13 years 7 months ago
Improved Binary Space Partition merging
This paper presents a new method for evaluating boolean set operations between Binary Space Partition (BSP) trees. Our algorithm has many desirable features including both numeric...
Mikola Lysenko, Roshan D'Souza, Ching-Kuan Shene
COMGEO
2008
ACM
13 years 7 months ago
Lower bounds for expected-case planar point location
Given a planar polygonal subdivision S, the point location problem is to preprocess S into a data structure so that the cell of the subdivision that contains a given query point c...
Theocharis Malamatos