Robust epsilon visibility

@inproceedings{Duguet2002RobustEV,
  title={Robust epsilon visibility},
  author={Florent Duguet and George Drettakis},
  booktitle={SIGGRAPH},
  year={2002}
}
Analytic visibility algorithms, for example methods which compute a subdivided mesh to represent shadows, are notoriously unrobust and hard to use in practice. We present a new method based on a generalized definition of extremal stabbing lines, which are the extremities of shadow boundaries. We treat scenes containing multiple edges or vertices in degenerate configurations, (e.g., collinear or coplanar). We introduce a robust ε method to determine whether each generalized extremal stabbing… CONTINUE READING
Highly Cited
This paper has 59 citations. REVIEW CITATIONS

Citations

Publications citing this paper.

60 Citations

051015'05'08'11'14'17
Citations per Year
Semantic Scholar estimates that this publication has 60 citations based on the available data.

See our FAQ for additional information.

References

Publications referenced by this paper.
Showing 1-6 of 6 references

Visibility Computations in Densely Occluded Polyhedral Environments

  • S. Teller
  • PhD thesis, UC Berkeley,
  • 1992
Highly Influential
6 Excerpts

Similar Papers

Loading similar papers…