Sciweavers

10608 search results - page 109 / 2122
» Complexity of O'Hara's Algorithm
Sort
View
AAAI
2008
14 years 12 days ago
Clustering on Complex Graphs
Complex graphs, in which multi-type nodes are linked to each other, frequently arise in many important applications, such as Web mining, information retrieval, bioinformatics, and...
Bo Long, Zhongfei (Mark) Zhang, Philip S. Yu, Tian...
COMPGEOM
2008
ACM
13 years 12 months ago
Delpsc: a delaunay mesher for piecewise smooth complexes
This video presents the working of a new algorithm/software called DelPSC that meshes piecewise smooth complexes in three dimensions with Delaunay simplices. Piecewise smooth comp...
Tamal K. Dey, Joshua A. Levine
ESA
2008
Springer
97views Algorithms» more  ESA 2008»
13 years 12 months ago
The Complexity of Bisectors and Voronoi Diagrams on Realistic Terrains
We prove tight bounds on the complexity of bisectors and Voronoi diagrams on so-called realistic terrains, under the geodesic distance. In particular, if n denotes the number of tr...
Boris Aronov, Mark de Berg, Shripad Thite
CORR
2004
Springer
110views Education» more  CORR 2004»
13 years 10 months ago
Shannon Information and Kolmogorov Complexity
The elementary theories of Shannon information and Kolmogorov complexity are cmpared, the extent to which they have a common purpose, and where they are fundamentally different. T...
Peter Grünwald, Paul M. B. Vitányi
TVCG
2012
179views Hardware» more  TVCG 2012»
12 years 15 days ago
Parallel Computation of 2D Morse-Smale Complexes
—The Morse-Smale complex is a useful topological data structure for the analysis and visualization of scalar data. This paper describes an algorithm that processes all mesh eleme...
Nithin Shivashankar, Senthilnathan M, Vijay Natara...