Sciweavers

145 search results - page 16 / 29
» Front Representation of Set Partitions
Sort
View
CG
2005
Springer
13 years 9 months ago
Combining SP-Octrees and impostors for the visualisation of multiresolution models
Space-Partition Octree (SP-Octree) is a hierarchical representation scheme for solid modelling. It allows a multiresolution representation of polyhedral objects, and has been succ...
Francisco J. Melero, Pedro Cano, Juan Carlos Torre...
CP
2007
Springer
14 years 1 months ago
Efficient Computation of Minimal Point Algebra Constraints by Metagraph Closure
Abstract. Computing the minimal network (or minimal CSP) representation of a given set of constraints over the Point Algebra (PA) is a fundamental reasoning problem. In this paper ...
Alfonso Gerevini, Alessandro Saetti
APDC
1997
13 years 11 months ago
An Improved Parallel Algorithm for Delaunay Triangulation on Distributed Memory Parallel Computers
Delaunaytriangulationhas beenmuchusedin suchapplicationsas volumerendering, shape representation, terrain modeling and so on. The main disadvantage of Delaunay triangulationis lar...
Sangyoon Lee, Chan-Ik Park, Chan-Mo Park
PPOPP
2012
ACM
12 years 5 months ago
Massively parallel breadth first search using a tree-structured memory model
Analysis of massive graphs has emerged as an important area for massively parallel computation. In this paper, it is shown how the Fresh Breeze trees-of-chunks memory model may be...
Tom St. John, Jack B. Dennis, Guang R. Gao
FLAIRS
2004
13 years 11 months ago
Adaptive K-Means Clustering
Clustering is used to organize data for efficient retrieval. One of the problems in clustering is the identification of clusters in given data. A popular technique for clustering ...
Sanjiv K. Bhatia