Layout Embedding via Combinatorial Optimization
Computer Graphics Forum, vol. 40, pp. 277–290
Abstract
Abstract We consider the problem of injectively embedding a given graph connectivity (a layout) into a target surface. Starting from prescribed positions of layout vertices, the task is to embed all layout edges as intersection‐free paths on the surface. Besides merely geometric choices (the shape of paths) this problem is especially challenging due to its topological degrees of freedom (how to route paths around layout vertices). The problem is typically addressed through a sequence of shortest path insertions, ordered by a greedy heuristic. Such insertion sequences are not guaranteed to be optimal: Early path insertions can potentially force later paths into unexpected homotopy classes. We show how common greedy methods can easily produce embeddings of dramatically bad quality, rendering such methods unsuitable for automatic processing pipelines. Instead, we strive to find the optimal order of insertions, i.e. the one that minimizes the total path length of the embedding. We demonstrate that, despite the vast combinatorial solution space, this problem can be effectively solved on simply‐connected domains via a custom‐tailored branch‐and‐bound strategy. This enables directly using the resulting embeddings in downstream applications which cannot recover from initializations in a wrong homotopy class. We demonstrate the robustness of our method on a shape dataset by embedding a common template layout per category, and show applications in quad meshing and inter‐surface mapping.
Authors 3
-
Janis Born Aachen
Affiliation as printed
RWTH Aachen University Germany
RWTH Aachen University Germany
-
Patrick Schmidt Aachen
Affiliation as printed
RWTH Aachen University Germany
RWTH Aachen University Germany
-
Leif P. Kobbelt Aachen
Affiliation as printed
RWTH Aachen University Germany
RWTH Aachen University Germany
Cited by 18 stored of 18
18 results
No patents citing this paper on Lens.org (checked 2026-10-06).
References 55
-
W3023950925details pending0citations
-
W2098443654details pending0citations
-
W2104313947details pending0citations
-
W3045099598details pending0citations