ppt课件-contourtreesforflexibleyetefficientconstructionof.pptVIP

Polygon overlay in double precision arithmeticOne example of why robust geometric code is hard to write Jack Snoeyink Andrea Mantler Computer Science, UNC Chapel Hill Outline Motivating problems Clipping, polygon ops, overlay, arrangement Study precision required by algorithm Quick summary of algorithms Test pairs, sweep, topological sweep A double-precision sweep algorithm “Spaghetti” segments Conclusions Three problems in the plane Polygon clipping  (graphics) Boolean operations  (CAD) Map overlay  (GIS) Build red/blue arrangement Why precision is an issue Algorithms find geometric r