Affiliation:
1. Southern Illinois University Edwardsville, Edwardsville, IL
Abstract
Moving regions are a form of spatiotemporal data in which a region changes in shape and/or position over time. In many fields, moving regions representing real-world phenomena are collected using sensors that take temporally encoded snapshots of regions. We provide a novel algorithm that creates a moving region between any two complex regions. The proposed algorithm has worst-case time bounds of
O;
(
n;
2
), but can use approximation techniques to achieve
O
(
n
lg
n
) in practice, space bounds of
O;
(
n;
), and output size bounded by
O;
(
n;
) (where
n;
is the number of line segments that define the boundaries of the regions).
Publisher
Association for Computing Machinery (ACM)
Subject
Discrete Mathematics and Combinatorics,Geometry and Topology,Computer Science Applications,Modeling and Simulation,Information Systems,Signal Processing
Cited by
18 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献