Expression packages constitute a key technique for achieving the fundamental goals of Exact Geometric Computation (EGC). In this paper, we address the redesign of the Expression Package in the Coreâ€¦ (More)

We say that a real number Î± is in Log space if its n-th bit (n âˆˆ Z) can be computed in O(log |n|) space. We show that Ï€ = 3.14159 Â· Â· Â· is in Log space. This implies that Ï€ is in the complexity classâ€¦ (More)

The mass deployment of IEEE 802.11 based wireless local area networks (WLAN), and increased sales in portable devices supporting WLAN, have resulted in an urgent need to support real timeâ€¦ (More)

s of the Invited Talks Invited Plenary Speakers and Talks Invited Plenary Speakers Jonathan Borwein University of Newcastle Bruno Buchberger RISC Johannes Kepler University Wolfram Decker Technischeâ€¦ (More)

1 Quadtrees are a well-known data structure for representing geometric data in the plane, and 2 naturally generalize to higher dimensions. A basic operation is to expand the tree by splitting 3 anyâ€¦ (More)

Many real-world processes and phenomena are modeled using systems of ordinary differential equations with parameters. Given such a system, we say that a parameter is globally identifiable if it canâ€¦ (More)

We present two parallel algorithms for constructing the Voronoi diagram of a. aet of n > 0 line segments in the plane: a) The first algorithm runs in 000g2 n) time using O(n) processors. Thisâ€¦ (More)

Voronoi diagrams are a central topic in Computational Geometry. They can be generalized in many ways. Suppose S is a finite set of geometric objects and there is a notion of Voronoi diagram V or(S)â€¦ (More)

Cohomology. In this case, we begin with any cochain complex, Â· Â· Â· Î´ â†’ C Î´ â†’ C Î´ â†’ Â· Â· Â· which is a sequence of Abelian groups and a boundary operator Î´ for successive pairs of this sequence. Noteâ€¦ (More)