Many algorithms developed in computational geometry are needlessly complicated and slow because they have to be prepared for very complicated, hypothetical inputs. To avoid this, realistic models are needed that describe the properties that realistic inputs have, so that algorithms can de designed that take advantage of these properties. This can lead to algorithms that are probably efficient in realistic situations. We obtain some fundamental results in this research direction. In particular, we have the following results. We show the relations between various models that have been proposed in the literature. For several of these models, we give algorithms to compute the model parameter(s) for a given scene; these algorithms can be used to verify whether a model is appropriate for typical scenes in some application area. As a case study, we give some experimental results on the appropriateness of some of the models for one particular type of scenes often encountered in GIS, namely certain triangulated irregular networks.
|Title of host publication||Proceedings of the 1997 13th Annual Symposium on Computational Geometry|
|Number of pages||10|
|State||Published - 1 Jan 1997|
|Event||Proceedings of the 1997 13th Annual Symposium on Computational Geometry - Nice, Fr|
Duration: 4 Jun 1997 → 6 Jun 1997
|Conference||Proceedings of the 1997 13th Annual Symposium on Computational Geometry|
|Period||4/06/97 → 6/06/97|