Katz, S., Leifman, G., and Tal, A. 2005. Mesh segmentation using feature point and core extraction. In Proceedings of Pacific Graphics, vol. 21, 649--658.

Google Scholar

[3]

Lien, J.-M., and Amato, N. M. 2006. Approximate convex decomposition of polyhedra. Tech. Rep. TR06--002, Texas A&M University.

Google Scholar

Cited By

View all

Taime ASaaidi ASatori K(2018)A new semantic segmentation approach of 3D mesh using the stereoscopic image colorsMultimedia Tools and Applications10.1007/s11042-018-5911-y77:20(27143-27162)Online publication date: 1-Oct-2018
https://dl.acm.org/doi/10.1007/s11042-018-5911-y
Li XIyengar S(2014)On Computing Mapping of 3D ObjectsACM Computing Surveys10.1145/266802047:2(1-45)Online publication date: 19-Dec-2014
https://dl.acm.org/doi/10.1145/2668020
Ghosh MAmato NLu YLien J(2013)Fast approximate convex decomposition using relative concavityComputer-Aided Design10.1016/j.cad.2012.10.03245:2(494-504)Online publication date: 1-Feb-2013
https://dl.acm.org/doi/10.1016/j.cad.2012.10.032
Show More Cited By

Index Terms

Variational, meaningful shape decomposition
1. Computing methodologies
  1. Computer graphics
    1. Shape modeling
2. Theory of computation
  1. Randomness, geometry and discrete structures
    1. Computational geometry

Recommendations

A proximal decomposition algorithm for variational inequality problems

In this paper, we propose a new decomposition algorithm for solving monotone variational inequality problems with linear constraints. The algorithm utilizes the problem's structure conductive to decomposition. At each iteration, the algorithm solves a ...
An LQP-Based Decomposition Method for Solving a Class of Variational Inequalities

The alternating direction method (ADM) is an influential decomposition method for solving a class of variational inequalities with block-separable structures. In the literature, the subproblems of the ADM are usually regularized by quadratic proximal ...
Minimum Near-Convex Shape Decomposition

Shape decomposition is a fundamental problem for part-based shape representation. We propose the minimum near-convex decomposition (MNCD) to decompose arbitrary shapes into minimum number of "near-convex" parts. The near-convex shape decomposition is ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

SIGGRAPH '06: ACM SIGGRAPH 2006 Sketches

July 2006

212 pages

ISBN:1595933646

DOI:10.1145/1179849

Conference Chair:
John Finnegan
Purdue University
,
Program Chair:
Hanspeter Pfister
Mitsubishi Electric Research Laboratories (MERL)

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 30 July 2006

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

SIGGRAPH06

Sponsor:

SIGGRAPH

SIGGRAPH06: Special Interest Group on Computer Graphics and Interactive Techniques Conference

July 30 - August 3, 2006

Massachusetts, Boston

Acceptance Rates

Overall Acceptance Rate 1,822 of 8,601 submissions, 21%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

11
Total Citations
View Citations
175
Total Downloads

Downloads (Last 12 months)1
Downloads (Last 6 weeks)0

Reflects downloads up to 22 Nov 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Taime ASaaidi ASatori K(2018)A new semantic segmentation approach of 3D mesh using the stereoscopic image colorsMultimedia Tools and Applications10.1007/s11042-018-5911-y77:20(27143-27162)Online publication date: 1-Oct-2018
https://dl.acm.org/doi/10.1007/s11042-018-5911-y
Li XIyengar S(2014)On Computing Mapping of 3D ObjectsACM Computing Surveys10.1145/266802047:2(1-45)Online publication date: 19-Dec-2014
https://dl.acm.org/doi/10.1145/2668020
Ghosh MAmato NLu YLien J(2013)Fast approximate convex decomposition using relative concavityComputer-Aided Design10.1016/j.cad.2012.10.03245:2(494-504)Online publication date: 1-Feb-2013
https://dl.acm.org/doi/10.1016/j.cad.2012.10.032
Thiery JBuchholz BTierny JBoubekeur T(2012)Analytic Curve Skeletons for 3D Surface Modeling and ProcessingComputer Graphics Forum10.1111/j.1467-8659.2012.03215.x31:7pt2(2223-2232)Online publication date: 1-Sep-2012
https://dl.acm.org/doi/10.1111/j.1467-8659.2012.03215.x
Simari PNowrouzezahrai DKalogerakis ESingh KPolthier KAlexa MKazhdan M(2009)Multi-objective shape segmentation and labelingProceedings of the Symposium on Geometry Processing10.5555/1735603.1735625(1415-1425)Online publication date: 15-Jul-2009
https://dl.acm.org/doi/10.5555/1735603.1735625
Simari PNowrouzezahrai DKalogerakis ESingh K(2009)Multi‐objective shape segmentation and labelingComputer Graphics Forum10.1111/j.1467-8659.2009.01518.x28:5(1415-1425)Online publication date: 31-Aug-2009
https://doi.org/10.1111/j.1467-8659.2009.01518.x
de Goes FGoldenstein SVelho LAlliez PRusinkiewicz S(2008)A hierarchical segmentation of articulated bodiesProceedings of the Symposium on Geometry Processing10.5555/1731309.1731315(1349-1356)Online publication date: 2-Jul-2008
https://dl.acm.org/doi/10.5555/1731309.1731315
De Goes FGoldenstein SVelho L(2008)A Hierarchical Segmentation of Articulated BodiesComputer Graphics Forum10.1111/j.1467-8659.2008.01274.x27:5(1349-1356)Online publication date: 29-Sep-2008
https://doi.org/10.1111/j.1467-8659.2008.01274.x
Wei Ma Bo Xiang Xiaopeng Zhang Hongbin Zha (2008)Decomposition of branching volume data by tip detection2008 15th IEEE International Conference on Image Processing10.1109/ICIP.2008.4712163(1948-1951)Online publication date: Oct-2008
https://doi.org/10.1109/ICIP.2008.4712163
Liu RZhang H(2007)Mesh Segmentation via Spectral Embedding and Contour AnalysisComputer Graphics Forum10.1111/j.1467-8659.2007.01061.x26:3(385-394)Online publication date: 12-Oct-2007
https://doi.org/10.1111/j.1467-8659.2007.01061.x
Show More Cited By

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Index Terms

Recommendations

A proximal decomposition algorithm for variational inequality problems

An LQP-Based Decomposition Method for Solving a Class of Variational Inequalities

Minimum Near-Convex Shape Decomposition