Loading...
Please wait, while we are loading the content...
Similar Documents
Generating Moving Regions from Snapshots of Complex Regions
| Content Provider | ACM Digital Library |
|---|---|
| Author | Frye, Roger Mckennney, Mark |
| Copyright Year | 2015 |
| 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 $\textit{O}(\textit{n}lg\textit{n})$ in practice, space bounds of $\textit{O;}(\textit{n;}),$ and output size bounded by $\textit{O;}(\textit{n;})$ (where $\textit{n;}$ is the number of line segments that define the boundaries of the regions). |
| Starting Page | 1 |
| Ending Page | 30 |
| Page Count | 30 |
| File Format | |
| ISSN | 23740353 |
| e-ISSN | 23740361 |
| DOI | 10.1145/2774220 |
| Volume Number | 1 |
| Issue Number | 1 |
| Journal | ACM Transactions on Spatial Algorithms and Systems (TSAS) |
| Language | English |
| Publisher | Association for Computing Machinery (ACM) |
| Publisher Date | 2015-07-16 |
| Publisher Place | New York |
| Access Restriction | One Nation One Subscription (ONOS) |
| Subject Keyword | Moving regions Polygon morphing Region interpolation |
| Content Type | Text |
| Resource Type | Article |
| Subject | Modeling and Simulation Computer Science Applications Information Systems Geometry and Topology Discrete Mathematics and Combinatorics Signal Processing |
