208 search results - page 29 / 42 » Blocking delaunay triangulations |
CIE
2005
Springer
14 years 27 days ago
2005
Springer
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...
COMPGEOM
2003
ACM
14 years 19 days ago
2003
ACM
Randomized incremental constructions are widely used in computational geometry, but they perform very badly on large data because of their inherently random memory access patterns...
BIRTHDAY
2003
Springer
14 years 18 days ago
2003
Springer
We discuss the design of Java applets that visualize how the Voronoi diagram of n points continuously changes as individual points are moved across the plane, or as the underlying...
COMPGEOM
1998
ACM
13 years 11 months ago
1998
ACM
A new algorithmic approach to comparing 2D patterns of protein spots obtained by the 2D gel electrophoresis technique is presented. Both the matching of a local pattern vs. a full...
COMPGEOM
1996
ACM
13 years 11 months ago
1996
ACM
Fast C implementations of four geometric predicates, the 2D and 3D orientation and incircle tests, are publicly available. Their inputs are ordinary single or double precision flo...