Publication Type

Co-author

Journals and Conferences

The key step in the construction of the Delaunay triangulation of a finite set of planar points is to establish correctly whether a given point of this set is inside or outside the circle determined… (More)

The domain-theoretic model of computational geometry provides us with continuous and computable predicates and binary operations. It can also be used to generalise the theory of computability for… (More)

Using the domain-theoretic model for geometric computation, we define the partial Delaunay triangulation and the partial Voronoi diagram of N partial points in R2 and show that these operations are… (More)

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 real functions. In… (More)