Sciweavers

51 search results - page 6 / 11
» Density-based clustering of polygons
Sort
View
JDA
2010
131views more  JDA 2010»
13 years 5 months ago
Convex drawings of hierarchical planar graphs and clustered planar graphs
: Hierarchical graphs are graphs with layering structures; clustered graphs are graphs with recursive clustering structures. Both have applications in VLSI design, CASE tools, soft...
Seok-Hee Hong, Hiroshi Nagamochi
SGP
2004
13 years 10 months ago
Parameterization of Triangle Meshes over Quadrilateral Domains
We present a method for parameterizing irregularly triangulated input models over polyhedral domains with quadrilateral faces. A combination of center-based clustering techniques ...
Ioana M. Boier-Martin, Holly E. Rushmeier, Jingyi ...
ICDE
2007
IEEE
165views Database» more  ICDE 2007»
14 years 8 months ago
Distance Based Subspace Clustering with Flexible Dimension Partitioning
Traditional similarity or distance measurements usually become meaningless when the dimensions of the datasets increase, which has detrimental effects on clustering performance. I...
Guimei Liu, Jinyan Li, Kelvin Sim, Limsoon Wong
SIGGRAPH
2000
ACM
13 years 11 months ago
Out-of-core simplification of large polygonal models
We present an algorithm for out-of-core simplification of large polygonal datasets that are too complex to fit in main memory. The algorithm extends the vertex clustering scheme o...
Peter Lindstrom
ICMLA
2004
13 years 8 months ago
PolyCluster: an interactive visualization approach to construct classification rules
This paper introduces a system, called PolyCluster, which adopts state-of-the-art algorithms for data visualization and integrates human domain knowledge into the construction pro...
Danyu Liu, Alan P. Sprague, Jeffrey G. Gray