20 search results - page 2 / 4 » Kinetic Data Structures: Animating Proofs Through Time |
COMPGEOM
2004
ACM
13 years 10 months ago
2004
ACM
Given a set of n points S in the plane, a triangulation of S is a subdivision of the convex hull into triangles whose vertices are from S. In the kinetic setting, the input point ...
VL
1996
IEEE
13 years 9 months ago
1996
IEEE
In this paper, we show how visual programming can be used to teach binary tree algorithms. In our approach, the student implements a binary tree algorithm by manipulating tree fra...
AMC
2006
13 years 5 months ago
2006
The problem of distinguishing density-independent (DI) from density-dependent (DD) demographic time series is important for understanding the mechanisms that regulate populations ...
CGF
2006
13 years 5 months ago
2006
Though ray tracing has recently become interactive, its high precomputation time for building spatial indices usually limits its applications to walkthroughs of static scenes. Thi...
ESORICS
2009
Springer
14 years 5 months ago
2009
Springer
Abstract. We study the problem of authenticating the content and creation time of documents generated by an organization and retained in archival storage. Recent regulations (e.g.,...