1 / 24

Computing Contour Maps & Answering Contour Queries Pankaj K. Agarwal Joint work with

Computing Contour Maps & Answering Contour Queries Pankaj K. Agarwal Joint work with. Lars Arge. Thomas Molhave. Bardia Sadri. The TerraStream Modules. What is a Terrain. Representation: Triangulated Irregular Network (TIN). Level Sets, Contours, and Contour Maps. Computing Contours Maps.

Download Presentation

Computing Contour Maps & Answering Contour Queries Pankaj K. Agarwal Joint work with

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript


  1. Computing Contour Maps & Answering Contour Queries Pankaj K. Agarwal Joint work with Lars Arge ThomasMolhave Bardia Sadri .

  2. The TerraStream Modules

  3. What is a Terrain

  4. Representation: Triangulated Irregular Network (TIN)

  5. Level Sets, Contours, and Contour Maps

  6. Computing Contours Maps

  7. Answering Contour Queries Preprocess Terrain S into a data structure Given h, compute contour at height h.

  8. Contour Maps

  9. Usage of contour lines (also called iso-contours, isogons, etc) goes back to at least 17th century Philosophical Transactions of Royal Society of London, 1779 Contour Maps

  10. Internal Memory Algorithm Find a seed point on each contour and traverse the triangulation to trace each contour Use a simple data structure to compute seed points Query time: O(log N + T) T: #contour edges Contour map: O(Nlog N +T) T: #contour map edges For massive terrains I/O efficiency is bad: O(N+T) instead of O((N+T)/B)

  11. I/O-Efficient Algorithms Answering a contour query: Preprocessing O(NlogBN), Space: O(N/B) blocks Query: O(logBN+T/B)

  12. Computing contour maps: O(Sort(N)+T/B) I/Os Answering contour queries Preprocessing Time: O(Sort(N)) I/Os Space: O(N/B) disk blocks Query: O(logBN+T/B) [ [ [ ] [ ] ] ] Our results Ordering Theorem:A total ordering, called C-ordering, of triangles can be computed in O(Sort(N))I/Os s.t. the subsequence of triangles intersecting a contour appears along the contour and contours in a level set are broken in nested order. Individual contours can be retrieved in O(T/B)I/Os from this ordering

  13. The Algorithm • Sort the vertices in the order of increasing height. • Compute the C-ordering of the triangles • Determine the rank of each triangle in C-ordreing. • Scan the triangles in the order of increasing height of their lowest vertices: • If a triangle intersects some level-set of interest add it to a buffer-tree using its rank for the key. • When the scan line reaches a height of interest, • flush the buffer tree • use the stack-based algorithm to extract individual contours. • Delete any triangle that does not intersect the next level-set. Use persistent buffer trees to store C-ordering at all heights!

  14. Computing the C-Ordering

  15. Height Graph

  16. Critical Points saddle maximum minimum regular

  17. Simple Terrains

  18. Positive and Negative Saddles

  19. Positive and Negative Cut-Trees

  20. Simplifying Terrains by Surgery

  21. [ [ [ ] [ ] ] ] What does simplification do to contours?

  22. (We believe) Our approach extends to higher genus 2-manifolds, i.e., contour queries in a fixed direction Extensions

  23. Computing iso-surface maps or answering iso-surface queries in the I/O model Future Directions Preprocess a given 2-manifold M, represented as a triangulation, in a linear-size data structure so that For a query plane h, report the contours of M∩h quickly Time: O(n2/3+T) in RAM Model

  24. Idea: grow contours contiguously but in parallel

More Related