12 search results - page 1 / 3 » A package for exact kinetic data structures and sweepline al... |
COMGEO
2007
ACM
13 years 4 months ago
2007
ACM
In this paper we present a package for implementing exact kinetic data structures built on objects which move along polynomial trajectories. We discuss how the package design was ...
ALENEX
2004
13 years 6 months ago
2004
We present a framework for implementing geometric algorithms involving motion. It is written in C++ and modeled after and makes extensive use of CGAL (Computational Geometry Algor...
ESA
2006
Springer
13 years 8 months ago
2006
Springer
We study the problem of designing kinetic data structures (KDS's for short) when event times cannot be computed exactly and events may be processed in a wrong order. In tradi...
BMCBI
2008
13 years 4 months ago
2008
Background: The principles of protein folding and evolution pose problems of very high inherent complexity. Often these problems are tackled using simplified protein models, e.g. ...
COMPGEOM
2001
ACM
13 years 8 months ago
2001
ACM
We propose a new randomized algorithm for maintaining a set of clusters among moving nodes in the plane. Given a specified cluster radius, our algorithm selects and maintains a va...