Partitioning Surfaces Into Quadrilateral Patches: A Survey

Campen, Marcel

doi:10.1111/cgf.13153

Cited by 36 publications

(22 citation statements)

References 150 publications

(267 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Layout Generation There exists a multitude of methods that generate coarse layouts for given models. [Cam17] for an extensive survey). While the above methods generate layouts in tandem with an embedding into the input surface, they can also be applied for the sole purpose of extracting layout templates.…”

Section: Related Workmentioning

confidence: 99%

Layout Embedding via Combinatorial Optimization

Born

Schmidt

Kobbelt

2021

Computer Graphics Forum

View full text Add to dashboard Cite

Figure 1: We embed a given layout connectivity (left, visualized as a coarse mesh for illustration) into a target surface with prescribed landmark positions (center left) by successively embedding edges as shortest paths in an optimized order. Previous methods choose a greedy sequence of locally optimal decisions, which can lead to severe topological artifacts (center right) due to accidental blocking of subsequently inserted paths. Our branch-and-bound method globally optimizes over all possible edge insertion sequences to find an embedding of shortest total path length, which yields the expected homotopy class (right).

show abstract

Section: Related Workmentioning

confidence: 99%

Layout Embedding via Combinatorial Optimization

Born

Schmidt

Kobbelt

2021

Computer Graphics Forum

View full text Add to dashboard Cite

show abstract

“…Our method falls in the category of coarse layout methods based on a coarse layout construction [Campen 2017]. Compared to literature, it advanced the state-of-the-art in terms of reliability, and in the ability to preserve feature-lines, without substantially sacrificing mesh-quality (in terms of quad shapes, number and distribution of irregular vertices, and so on).…”

Section: Related Workmentioning

confidence: 99%

Reliable feature-line driven quad-remeshing

et al. 2021

View full text Add to dashboard Cite

We present a new algorithm for the semi-regular quadrangulation of an input surface, driven by its line features, such as sharp creases. We define a perfectly feature-aligned cross-field and a coarse layout of polygonal-shaped patches where we strictly ensure that all the feature-lines are represented as patch boundaries. To be able to consistently do so, we allow non-quadrilateral patches and T-junctions in the layout; the key is the ability to constrain the layout so that it still admits a globally consistent, T-junction-free, and pure-quad internal tessellation of its patches.

show abstract

“…Representing curved surfaces with a set of Bézier patches is a common approach [Cam17]. Although cubic (or higher degree) patches can be used to control the surface curvature, ray intersection tests lead to time consuming computations [Kaj82,Tot85].…”

Section: Representation For Rounded Cornersmentioning

confidence: 99%

SREC‐RT: A Structure for Ray Tracing Rounded Edges and Corners

Courtin

Ribardière

Horna

et al. 2021

Computer Graphics Forum

View full text Add to dashboard Cite

Man-made objects commonly exhibit rounded edges and corners generated through their manufacturing processes. The variation of surface normals at these confined locations produces shading details that are visually essential to the realism of synthetic scenes. The more specular the surface, the finer and more prominent its highlights. However, most geometric modellers represent rounded edges and corners with dense polygonal meshes that are limited in terms of smoothness, while tremendously increasing scene complexity. This paper proposes a non-invasive method (i.e. that does not modify the original geometry) for the modelling and rendering of smooth edges and corners from any input polygonal geometry defined with infinitely sharp edges. At the heart of our contribution is a geometric structure that automatically and accurately defines the geometry of edge and corner rounded areas, as well as the topological relationships at edges and vertices. This structure, called SREC-RT, is integrated in a ray-tracingbased acceleration structure in order to determine the region of interest of each rounded edge and corner. It allows systematic rounding of all edges and vertices without increasing the 3D scene geometric complexity. While the underlying rounded geometry can be of any type, we propose a practical ray-edge and ray-corner intersection based on parametric surfaces. We analyse comparisons generated with existing methods. Our results present the advantages of our method, including extreme close-up views of surfaces with a much higher quality for very little additional memory, and reasonable computation time overhead.

show abstract

Partitioning Surfaces Into Quadrilateral Patches: A Survey

Cited by 36 publications

References 150 publications

Layout Embedding via Combinatorial Optimization

Layout Embedding via Combinatorial Optimization

Reliable feature-line driven quad-remeshing

SREC‐RT: A Structure for Ray Tracing Rounded Edges and Corners

Contact Info

Product

Resources

About