A dimension-dependent approximate Carathéodory theorem yields explicit contraction rates for Delaunay mesh refinement that exceed those of standard subdivision.
A Packing Problem with Applications to Lettering of Maps
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
cs.CG 2verdicts
UNVERDICTED 2representative citing papers
Proves NP-hardness of selecting a maximum centre-disjoint subset of disks with merging of the rest and gives ILP plus linear-time algorithm for collinear centers.
citing papers explorer
-
Sharp approximate Carath\'eodory theorem and application to iterated Delaunay refinement
A dimension-dependent approximate Carathéodory theorem yields explicit contraction rates for Delaunay mesh refinement that exceed those of standard subdivision.
-
Maximum Centre-Disjoint Mergeable Disks
Proves NP-hardness of selecting a maximum centre-disjoint subset of disks with merging of the rest and gives ILP plus linear-time algorithm for collinear centers.