1313 search results - page 49 / 263 » Data Discretization Unification |
114
click to vote
DEXA
2004
Springer
15 years 7 months ago
2004
Springer
We present a framework for representing the trajectories of moving objects and the time-varying results of operations on moving objects. This framework supports the realization of ...
109
click to vote
COMPGEOM
1999
ACM
15 years 6 months ago
1999
ACM
We define the path of a pseudo-triangulation, a data structure generalizing the path of a triangulation of a point set. This structure allows us to use divide-andconquer type of ...
155
Voted
VVS
1995
IEEE
15 years 6 months ago
1995
IEEE
Interpolating discrete volume data into a continuous form adapts implicit surface techniques for rendering volumetric iso-surfaces. One such algorithm uses the Lipschitz condition...
120
click to vote
COMPGEOM
2008
ACM
15 years 4 months ago
2008
ACM
We present a kinetic data structure for maintaining a (1+ )-spanner of size O(n/2 ) for a set of n moving points in the plane. Assuming the trajectories of the points can be descr...
119
Voted
RTAS
2003
IEEE
15 years 7 months ago
2003
IEEE
Model-based automatic code generation is a process of converting abstract models into concrete implementations in the form of a program written in a high-level programming languag...