Sciweavers

51 search results - page 4 / 11
» Density-based clustering of polygons
Sort
View
CIDM
2009
IEEE
14 years 2 months ago
Density-based clustering of polygons
– Clustering is an important task in spatial data mining and spatial analysis. We propose a clustering algorithm P-DBSCAN to cluster polygons in space. PDBSCAN is based on the we...
Deepti Joshi, Ashok Samal, Leen-Kiat Soh
EGPGV
2011
Springer
330views Visualization» more  EGPGV 2011»
12 years 11 months ago
Real-Time Ray Tracer for Visualizing Massive Models on a Cluster
We present a state of the art read-only distributed shared memory (DSM) ray tracer capable of fully utilizing modern cluster hardware to render massive out-of-core polygonal model...
Thiago Ize, Carson Brownlee, Charles D. Hansen
CCCG
2010
13 years 9 months ago
Cluster connecting problem inside a polygon
The cluster connecting problem inside a simple polygon is introduced in this paper. The problem is shown to be NP-complete. A log n-factor approximation algorithm is proposed.
Sanjib Sadhu, Arijit Bishnu, Subhas C. Nandy, Part...
SIGGRAPH
2010
ACM
13 years 12 months ago
Triangle surfaces with discrete equivalence classes
We propose a technique that takes a triangulated surface as input and outputs a surface with the same topology but altered geometry such that each polygon falls into a set of disc...
Mayank Singh, Scott Schaefer
JCP
2008
133views more  JCP 2008»
13 years 7 months ago
DDSC : A Density Differentiated Spatial Clustering Technique
Finding clusters with widely differing sizes, shapes and densities in presence of noise and outliers is a challenging job. The DBSCAN is a versatile clustering algorithm that can f...
Bhogeswar Borah, Dhruba K. Bhattacharyya