Gehre, AnneLim, IsaakKobbelt, LeifJoaquim Jorge and Ming Lin2016-04-262016-04-2620161467-8659https://doi.org/10.1111/cgf.12834Feature curves on surface meshes are usually defined solely based on local shape properties such as dihedral angles and principal curvatures. From the application perspective, however, the meaningfulness of a network of feature curves also depends on a global scale parameter that takes the distance between feature curves into account, i.e., on a coarse scale, nearby feature curves should be merged or suppressed if the surface region between them is not representable at the given scale/resolution. In this paper, we propose a computational approach to the intuitive notion of scale conforming feature curve networks where the density of feature curves on the surface adapts to a global scale parameter. We present a constrained global optimization algorithm that computes scale conforming feature curve networks by eliminating curve segments that represent surface features, which are not compatible to the prescribed scale. To demonstrate the usefulness of our approach we apply isotropic and anisotropic remeshing schemes that take our feature curve networks as input. For a number of example meshes, we thus generate high quality shape approximations at various levels of detail.I.3.3 [Computer Graphics]Computational GeometryDigital Geometry ProcessingLevel Of Detail AlgorithmsFeature Curve Networks10.1111/cgf.12834319-330