Feature-aware partitions from the motorcycle graph

Günpinar, Erkan; Moriguchi, Masaki; Suzuki, Hiromasa; Ohtake, Yutaka

doi:10.1016/j.cad.2013.09.003

Cited by 13 publications

(6 citation statements)

References 27 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…The algorithms described in this paper are drawing on two other important sources: motorcycle graph constructions [Eppstein et al 2008;Gunpinar et al 2014] and robust field tracing using edge maps [Jadhav et al 2012]. On surfaces, so far, motorcycle graph constructions were applied to quadrangulations, not cross-fields.…”

Section: Related Workmentioning

confidence: 99%

Robust field-aligned global parametrization

2014

View full text Add to dashboard Cite

Figure 1: Main steps of our construction, from left to right: initial field, feature-aligned inconsistent partition, collapse operations on zero chains, initial parametrization based on partition, final parametrization. AbstractWe present a robust method for computing locally bijective global parametrizations aligned with a given cross-field. The singularities of the parametrization in general agree with singularities of the field, except in a small number of cases when several additional cones need to be added in a controlled way. Parametric lines can be constrained to follow an arbitrary set of feature lines on the surface. Our method is based on constructing an initial quad patch partition using robust cross-field integral line tracing. This process is followed by an algorithm modifying the quad layout structure to ensure that consistent parametric lengths can be assigned to the edges. For most meshes, the layout modification algorithm does not add new singularities; a small number of singularities may be added to resolve an explicitly described set of layouts. We demonstrate that our algorithm succeeds on a test data set of over a hundred meshes.

show abstract

Section: Related Workmentioning

confidence: 99%

Robust field-aligned global parametrization

2014

View full text Add to dashboard Cite

show abstract

“…Additionally, it will be interesting to study on the automatic setting for the k value that is used in the clustering algorithm. Finally, we would like to extend our model retrieval technique for quadrilateral meshes (generated using mixed-integer quadrangulation (Bommes et al.,2009) which are segmented into quad partitions using motorcycle graph ( Eppstein et al, 2008;Bommes et al, 2009;Gunpinar et al, 2013;Gunpinar et al, 2014a;Gunpinar et al, 2014b. ).…”

Section: Discussionmentioning

confidence: 99%

A K-Means Clustering Based Shape Retrieval Technique for 3d Mesh Models

Rezaei

Günpinar

2018

Scitech

Self Cite

View full text Add to dashboard Cite

Due to the large size of shape databases, importance of effective and robust method in shape retrieval has been increased. Researchers mainly focus on finding descriptors which is suitable for rigid models. Retrieval of non-rigid models is a still challenging field which needs to be studied more. For non-rigid models, descriptors that are designed should be insensitive to different poses. For nonrigid model retrieval, we propose a new method which first divides a model into clusters using geodesic distance metric and then computes its descriptor using the area of these clusters. A skeleton-based Kmeans clustering method is utilized for dividing the model into clusters. Each cluster is represented by an area based descriptor which is invariant to scale and orientation. Articulated objects from human to animals are employed in this study's experiments for the validation of the proposed retrieval algorithm.

show abstract

“…Existing approaches to automatic non‐conforming quad layout construction often respect this implicitly (without explicit mention): they take as input a conforming quad layout or mesh, and obtain a T‐layout as a subset thereof [MPKZ10, LRL06, SCF*04, EGKT08, GMSO14], a locally regular refinement thereof [WZXH12, SZBN03] or as a subset of the iso‐parametric curves of a global seamless surface parametrization (cf. Section ) [HWW*06, CBK15].…”

Section: Foundationsmentioning

confidence: 99%

Partitioning Surfaces Into Quadrilateral Patches: A Survey

Campen

2017

Computer Graphics Forum

View full text Add to dashboard Cite

The efficient and practical representation and processing of geometrically or topologically complex shapes often demands a partitioning into simpler patches. Possibilities range from unstructured arrangements of arbitrarily shaped patches on the one end, to highly structured conforming networks of all‐quadrilateral patches on the other end of the spectrum. Due to its regularity, this latter extreme of conforming partitions with quadrilateral patches, called quad layouts, is most beneficial in many application scenarios, for instance enabling the use of tensor‐product representations based on splines or Bézier patches, grid‐based multi‐resolution techniques and discrete pixel‐based map representations. However, this type of partition is also most complicated to create due to the strict inherent structural restrictions. Traditionally often performed manually in a tedious and demanding process, research in computer graphics and geometry processing has led to a number of computer‐assisted, semi‐automatic, as well as fully automatic approaches to address this problem more efficiently. This survey provides a detailed discussion of this range of methods, treats their strengths and weaknesses and outlines open problems in this field of research.

show abstract

Feature-aware partitions from the motorcycle graph

Cited by 13 publications

References 27 publications

Robust field-aligned global parametrization

Robust field-aligned global parametrization

A K-Means Clustering Based Shape Retrieval Technique for 3d Mesh Models

Partitioning Surfaces Into Quadrilateral Patches: A Survey

Contact Info

Product

Resources

About