Hierarchical decomposition of the plane with applications
to circular ray-shooting.
SPEAKER:
Hazel Everett, UQAM
A natural way to solve geometric problems is to
partition space into regions and then to solve the problem
in each region separately. Applying this strategy recursively
yields a hierarchical decomposition of space. Such a
decomposition forms the basis of a data structure.
In this talk I'll show how to compute one such hierarchical
decomposition and how it can be used to solve some
geometric search problems such as circular ray-shooting.
This information is available at
http://cgm.cs.mcgill.ca/~therese/seminar.
Direct questions, comments, additions to and removals from the mailing list, and
suggestions for speakers to Therese Biedl at
therese@cgm.cs.mcgill.ca.