encasement a method to compute geometric arrangements
play

Encasement: A method to compute geometric arrangements Joseph - PowerPoint PPT Presentation

Encasement: A method to compute geometric arrangements Joseph Masterjohn University of Miami Department of Computer Science Sept 30, 2015 Overview Overview What is an Arrangement? Start with a sheet of material. What is an Arrangement?


  1. What is an Encasement? A collection of connected convex cells in the plane that isolate the features of the arrangement of curves is an Encasement if:

  2. What is an Encasement? A collection of connected convex cells in the plane that isolate the features of the arrangement of curves is an Encasement if: No vertex of a cell lies on a curve. 1

  3. What is an Encasement? A collection of connected convex cells in the plane that isolate the features of the arrangement of curves is an Encasement if: No vertex of a cell lies on a curve. 1 A cell edge intersects up to one curve in a single point. 2

  4. What is an Encasement? A collection of connected convex cells in the plane that isolate the features of the arrangement of curves is an Encasement if: No vertex of a cell lies on a curve. 1 A cell edge intersects up to one curve in a single point. 2 A cell intersects up to two curves as simple segments. 3

  5. What is an Encasement? A collection of connected convex cells in the plane that isolate the features of the arrangement of curves is an Encasement if: No vertex of a cell lies on a curve. 1 A cell edge intersects up to one curve in a single point. 2 A cell intersects up to two curves as simple segments. 3 If a cell intersects two curves, those curves have one 4 intersection point.

  6. Valid Encasement

  7. Valid Encasement

  8. Invalid Encasement

  9. Invalid Encasement

  10. Invalid Encasement

  11. Full Encasement

  12. How does an encasement solve the original problem of finding an arrangement?

  13. How does an encasement solve the original problem of finding an arrangement? How can we compute some feature of the arrangement using the Encasement?

  14. Full Encasement

  15. Full Encasement

  16. OK we’ll start out with a single cell, the boundary cell.

  17. OK we’ll start out with a single cell, the boundary cell. If no rules are violated, we’re done, we have a valid Encasement.

  18. OK we’ll start out with a single cell, the boundary cell. If no rules are violated, we’re done, we have a valid Encasement. If not, how do we fix those violating situations we encountered before?

  19. OK we’ll start out with a single cell, the boundary cell. If no rules are violated, we’re done, we have a valid Encasement. If not, how do we fix those violating situations we encountered before? One simple operation: split .

  20. Fixing Invalid Encasement

  21. Fixing Invalid Encasement

  22. Fixing Invalid Encasement

  23. Overview

  24. Split Edges

  25. Split Edges

  26. Overview

  27. Isolate segments of one curve

  28. Isolate segments of one curve

  29. Isolate segments of one curve

  30. Isolate segments of one curve

  31. Overview

  32. Isolate segments of two curves

  33. Isolate segments of two curves

  34. Isolate segments of two curves

  35. Isolate segments of two curves

  36. Overview

  37. Isolate intersections We know two curves intersect at least once in a cell by looking at the order of the intersections with the boundary.

  38. Isolate intersections But that doesn’t sufficiently tell us that there is only one. There could be an odd number of intersections inside the cell.

  39. Isolate intersections Notice the tangents at the intersections though. If the two curves intersect more than once, then their tangent cones intersect.

Recommend


More recommend