Marcel Campen

Marcel Campen

Auto-generated profile, based on publicly available information

Marcel Campen

Paderborn University Germany

Research Focus & Metrics

Academic Career Length

18Years (2009-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
21 July 2013 in ACM Transactions on Graphics
Verified
Journal Article
Open access
DBDavid Bommes
David Bommes
MCMarcel Campen
Marcel Campen
HEHans-Christian Ebke
Hans-Christian Ebke
PAPierre Alliez
Pierre Alliez
LKLeif Kobbelt
Leif Kobbelt
Quadrilateral remeshing approaches based on global parametrization enable many desirable mesh properties. Two of the most important ones are (1) high regularity due to explicit control over irregular vertices and (2) smooth distribution of distortion achieved by convex variational formulations. Apart from these strengths, state-of-the-art techniques suffer from limited reliability on real-world input data, i.e. the determined map might have degeneracies like (local) non-injectivities and consequently often cannot be used directly to generate a quadrilateral mesh. In this paper we propose a novel convex Mixed-Integer Quadratic Programming (MIQP) formulation which ensures by construction that the resulting map is within the class of so called Integer-Grid Maps that are guaranteed to imply a quad mesh. In order to overcome the NP-hardness of MIQP and to be able to remesh typical input geometries in acceptable time we propose two additional problem specific optimizations: a complexity reduction algorithm and singularity separating conditions. While the former decouples the dimension of the MIQP search space from the input complexity of the triangle mesh and thus is able to dramatically speed up the computation without inducing inaccuracies, the latter improves the continuous relaxation, which is crucial for the success of modern MIQP optimizers. Our experiments show that the reliability of the resulting algorithm does not only annihilate the main drawback of parametrization based quad-remeshing but moreover enables the global search for high-quality coarse quad layouts - a difficult task solely tackled by greedy methodologies before.

27 May 2016 in Computer Graphics Forum
Verified
Journal Article
Closed access
PDF file
AVAmir Vaxman
Amir Vaxman
MCMarcel Campen
Marcel Campen
ODOlga Diamanti
Olga Diamanti
DPDaniele Panozzo
Daniele Panozzo
DBDavid Bommes
David Bommes
MBMirela Ben‐Chen
Mirela Ben‐Chen

1 February 2013 in ACM Computing Surveys
Verified
Journal Article
Open access
MAMarco Attene
Marco Attene
MCMarcel Campen
Marcel Campen
LKLeif Kobbelt
Leif Kobbelt
Nowadays, digital 3D models are in widespread and ubiquitous use, and each specific application dealing with 3D geometry has its own quality requirements that restrict the class of acceptable and supported models. This article analyzes typical defects that make a 3D model unsuitable for key application contexts, and surveys existing algorithms that process, repair, and improve its structure, geometry, and topology to make it appropriate to case-by-case requirements. The analysis is focused on polygon meshes, which constitute by far the most common 3D object representation. In particular, this article provides a structured overview of mesh repairing techniques from the point of view of the application context. Different types of mesh defects are classified according to the upstream application that produced the mesh, whereas mesh quality requirements are grouped by representative sets of downstream applications where the mesh is to be used. The numerous mesh repair methods that have been proposed during the last two decades are analyzed and classified in terms of their capabilities, properties, and guarantees. Based on these classifications, guidelines can be derived to support the identification of repairing algorithms best-suited to bridge the compatibility gap between the quality provided by the upstream process and the quality required by the downstream applications in a given geometry processing scenario.

2 November 2015 in ACM Transactions on Graphics
Verified
Journal Article
Open access
MCMarcel Campen
Marcel Campen
DBDavid Bommes
David Bommes
LKLeif Kobbelt
Leif Kobbelt
Global surface parametrization often requires the use of cuts or charts due to non-trivial topology. In recent years a focus has been on so-calledseamlessparametrizations, where the transition functions across the cuts are rigid transformations with a rotation about some multiple of 90°. Of particular interest, e.g. for quadrilateral meshing, paneling, or texturing, are those instances where in addition the translational part of these transitions is integral (or more generally: quantized). We show that finding not even the optimal, but just an arbitrary valid quantization (one that does not imply parametric degeneracies), is a complex combinatorial problem. We present a novel method that allows us to solve it, i.e. to find valid as well as good quality quantizations. It is based on an original approach to quickly construct solutions to linear Diophantine equation systems, exploiting the specific geometric nature of the parametrization problem. We thereby largely outperform the state-of-the-art, sometimes by several orders of magnitude.

18 October 2022 in ACM Transactions on Graphics
Verified
Journal Article
Open access
NPNico Pietroni
Nico Pietroni
MCMarcel Campen
Marcel Campen
ASAlla Sheffer
Alla Sheffer
Gianmarco CherchiGianmarco Cherchi
Gianmarco Cherchi
DBDavid Bommes
David Bommes
MLMarco Livesu
Marco Livesu
In this article, we provide a detailed survey of techniques for hexahedral mesh generation. We cover the whole spectrum of alternative approaches to mesh generation, as well as post-processing algorithms for connectivity editing and mesh optimization. For each technique, we highlight capabilities and limitations, also pointing out the associated unsolved challenges. Recent relaxed approaches, aiming to generate not pure-hex but hex-dominant meshes, are also discussed. The required background, pertaining to geometrical as well as combinatorial aspects, is introduced along the way.

1 May 2010 in Computer Graphics Forum
Verified
Journal Article
Closed access
PDF file
MCMarcel Campen
Marcel Campen
LKLeif Kobbelt
Leif Kobbelt