(in WR FranklinResearch)

This relies on the useful property that, if the input faces are IID (independently and identically distributed), then the expected number of visible edge pieces is linear in the number of input edges, and I can find them all in expected linear time.

This is remarkable since the total number of intersections of the projected input edges might be superlinear if the edges' lengths do not shrink fast enough. However, in that case, most of those intersections are hidden, and I can delete them in groups w/o spending even constant time per one. (1978)

1. bibtexsummary:[/wrf.bib,fk-poshs-90-in-geom]
2. bibtexsummary:[/wrf.bib,f-ltehs-88]
Paper.
3. bibtexsummary:[/wrf.bib,fa-agpvo-88-in-geom]
4. bibtexsummary:[/wrf.bib,fa-sehla-87]
5. bibtexsummary:[/wrf.bib,f-ehsao-81]
6. bibtexsummary:[/wrf.bib,f-ltehs-80-in-geom]
7. bibtexsummary:[/wrf.bib,f-chsa-78]