Sciweavers

13 search results - page 3 / 3
» On the Number of Higher Order Delaunay Triangulations
Sort
View
SMA
1995
ACM
217views Solid Modeling» more  SMA 1995»
13 years 9 months ago
Bubble mesh: automated triangular meshing of non-manifold geometry by sphere packing
This paper presents a new computational method for fully automated triangular mesh generation, consistently applicable to wire-frame, surface, solid, and nonmanifold geometries. T...
Kenji Shimada, David C. Gossard
CIE
2005
Springer
13 years 11 months ago
Computability in Computational Geometry
We promote the concept of object directed computability in computational geometry in order to faithfully generalise the wellestablished theory of computability for real numbers and...
Abbas Edalat, Ali Asghar Khanban, André Lie...
DIALM
2003
ACM
175views Algorithms» more  DIALM 2003»
13 years 10 months ago
Localized construction of bounded degree and planar spanner for wireless ad hoc networks
We propose a novel localized algorithm that constructs a bounded degree and planar spanner for wireless ad hoc networks modeled by unit disk graph (UDG). Every node only has to kn...
Yu Wang 0003, Xiang-Yang Li