Fractal Simplification of Lines Using Convex Hulls

14Citations
Citations of this article
8Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

We investigate the problem of the simplification of a curve from a geometric viewpoint. Starting from a fractal hypothesis, we consider that the best methods are those that keep an estimated value of the fractal dimension constant, before and after simplification. We propose a simplification rule based on the use of local convex hulls that corresponds to a new algorithm for computing fractal dimension. This algorithm is both accurate and universal, and does not imply the need to make arbitrary hypotheses regarding the structure of the curve. A comparison is made with other fractal approaches and with the well‐known Douglas‐Peucker method. 1993 The Ohio State University

Cite

CITATION STYLE

APA

Normant, F., & Tricot, C. (1993). Fractal Simplification of Lines Using Convex Hulls. Geographical Analysis, 25(2), 118–129. https://doi.org/10.1111/j.1538-4632.1993.tb00284.x

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free