A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2016; you can also visit the original URL.
The file type is application/pdf.
Filters
Randomized cuts for 3D mesh analysis
2008
ACM Transactions on Graphics
Preserved Fulltext
The resulting "partition function" defined on edges provides a continuous measure of where natural part boundaries occur in a mesh, and the set of "most consistent cuts" provides a stable list of global ...
The paper describes methods for generating random distributions of mesh segmentations, studies sensitivity of the resulting partition functions to noise, tessellation, pose, and intra-class shape variations ...
We also thank Aim@Shape, Stanford, Cyberware, Lior Shapira, Marco Attene, Daniela Giorgi, Ayellet Tal, and others for providing 3D surface models, and we acknowedge NSF (CNFS-0406415, IIS-0612231, and ...
doi:10.1145/1409060.1409098
fatcat:sdmqofukrzdupasinzsjq252bq
Randomized cuts for 3D mesh analysis
2008
ACM SIGGRAPH Asia 2008 papers on - SIGGRAPH Asia '08
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2016; you can also visit the original URL.
The file type is application/pdf.
The resulting "partition function" defined on edges provides a continuous measure of where natural part boundaries occur in a mesh, and the set of "most consistent cuts" provides a stable list of global ...
The paper describes methods for generating random distributions of mesh segmentations, studies sensitivity of the resulting partition functions to noise, tessellation, pose, and intra-class shape variations ...
We also thank Aim@Shape, Stanford, Cyberware, Lior Shapira, Marco Attene, Daniela Giorgi, Ayellet Tal, and others for providing 3D surface models, and we acknowedge NSF (CNFS-0406415, IIS-0612231, and ...
doi:10.1145/1457515.1409098
fatcat:ilg7r3l3wfbpjewtcga65zslh4
Supervised, Geometry-Aware Segmentation of 3D Mesh Models
2012
2012 IEEE International Conference on Multimedia and Expo Workshops
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2012; you can also visit the original URL.
The file type is application/pdf.
Evaluation using a 3D model segmentation benchmark dataset has shown that the method is effective, although achieving interactivity for a large and complex mesh requires some work. ...
Segmentation of 3D model models has applications, e.g., in mesh editing and 3D model retrieval. Unsupervised, automatic segmentation of 3D models can be useful. ...
ACKNOWLEDGEMENTS This research has been funded in part by the Ministry of Education, Culture, Sports, Sciences, and Technology of Japan (No. 18300068). ...
doi:10.1109/icmew.2012.16
dblp:conf/icmcs/BambaO12
fatcat:n4oyq5ogeng6npk62xcih4hyta
A survey on Mesh Segmentation Techniques
2008
Computer graphics forum (Print)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Recently, these have become a part of many mesh and object manipulation algorithms in computer graphics, geometric modelling and computer aided design. ...
We present a review of the state of the art of segmentation and partitioning techniques of boundary meshes. ...
Acknowledgements The author would like to thank the reviewers for valuable comments and suggestions, and Hugues Hoppe for permission to use images of his work. ...
doi:10.1111/j.1467-8659.2007.01103.x
fatcat:wvrtpb642jhyxe7ikosjrm5qtu
Hierarchical Partitioning and Dynamic Load Balancing for Scientific Computation
[chapter]
2006
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2004; you can also visit the original URL.
The file type is application/pdf.
Here, different balancing procedures are used in different parts of the domain. Preliminary results show benefits to using hierarchical partitionings on hierarchical systems. ...
We focus on partitioning and dynamic load balancing, in particular on hierarchical procedures implemented within the Zoltan Toolkit, guided by DRUM, the Dynamic Resource Utilization Model. ...
The authors would like to thank Erik Boman, Karen Devine, and Bruce Hendrickson (Sandia National Laboratories, Albuquerque, USA) for their valuable input on the design of Zoltan's hierarchical balancing ...
doi:10.1007/11558958_110
fatcat:adbe363jxjdyfibx5uooqfhzau
Constrained planar cuts - Object partitioning for point clouds
2015
2015 IEEE Conference on Computer Vision and Pattern Recognition (CVPR)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2016; you can also visit the original URL.
The file type is application/pdf.
Attention, Perception, & Psy-
select which partitioning model to use. ...
and normals ~n1 , ~n2 we treat their connection as convex if
planar cuts which match a semi-global hierarchical con-
cave boundary model. ...
doi:10.1109/cvpr.2015.7299157
dblp:conf/cvpr/SchoelerPW15
fatcat:76ugxteeevd27ewrupfl3iuyeq
Consistent mesh partitioning and skeletonisation using the shape diameter function
2008
The Visual Computer
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2008; you can also visit the original URL.
The file type is application/pdf.
The result of the graph-cut algorithm is a smooth partitioning of the mesh, clearly separating distinct parts. ...
The first uses soft-clustering of the mesh elements (faces) to k clusters based on their SDF values, and the second finds the actual partitioning using k-way graph-cut to include local mesh geometric properties ...
doi:10.1007/s00371-007-0197-5
fatcat:te75y67mnffx7jv5db33d553sm
Prop-cut: A mesh cutting method based on Tikhonov regularization
2009
2009 11th IEEE International Conference on Computer-Aided Design and Computer Graphics
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
The presented computing framework can not only do segmentation for single static mesh models using shape information, but also do segmentation for dynamic mesh models based on deformation information. ...
We present an interactive mesh cutting method in this paper, which is based on a formulation of semi-supervised learning. ...
First the 1-ring neighborhood around faces of the isoline is selected. Then a dual graph for all selected faces is built by using faces as graph nodes and connecting adjacent face nodes. ...
doi:10.1109/cadcg.2009.5246899
dblp:conf/cadgraphics/ZhangW09a
fatcat:cwqxnyyfhfe6jjvdj4hmqy637e
Hierarchical aggregation for efficient shape extraction
2008
The Visual Computer
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Both our automatic and the interactive shape extraction methods do not require explicit connectivity information, and thus are applicable to unorganized point sets. ...
This paper presents an efficient framework which supports both automatic and interactive shape extraction from surfaces. ...
Acknowledgement We would like to thank Ligang Liu for the code of the easy mesh cutting algorithm [12] . We would also like to thank the anonymous reviewers for their insightful comments. ...
doi:10.1007/s00371-008-0226-z
fatcat:hpd3fkvzhrdqvbjt5z5pu3a3eq
Segment-based tetrahedral meshing and rendering
2006
Proceedings of the 4th international conference on Computer graphics and interactive techniques in Australasia and Southeast Asia - GRAPHITE '06
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2007; you can also visit the original URL.
The file type is application/pdf.
Dependencies between segments are stored in a hierarchical graph and ensure a consistent mesh at any time. ...
We present a meshing and rendering framework for large unstructured tetrahedral meshes which is based on a collection of segments that form a multi resolution model. ...
for the Rbl dataset, Udo Tremel from EADS-M. for the F16-like model. ...
doi:10.1145/1174429.1174507
dblp:conf/graphite/SondershausS06
fatcat:mazke2rcozhatjqrvzkvuoxkpi
A comparative evaluation of foreground/background sketch-based mesh segmentation algorithms
2011
Computers & graphics
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2012; you can also visit the original URL.
The file type is application/pdf.
To investigate how well the interactive segmentations match the ground-truth, five metrics were used to measure the boundary and region accuracy of segmentations. ...
To facilitate the comparison, we have developed a complete framework with an intuitive and simple sketch-based interface to enable interactive mesh segmentation by marking strokes to specify the foreground ...
[15] RWS Bottom-up aggregation Hierarchical aggregation for efficient shape extraction [23] HAE Graph-cut Interactive part selection for mesh and point models using hierarchical graph-cut partitioning ...
doi:10.1016/j.cag.2011.03.038
fatcat:dovldgq62fgixizv3dhx72nzuy
Improving Locality for Adaptive Irregular Scientific Codes
[chapter]
2001
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
We develop parameters to guide both geometric (RCB) and graph partitioning (METIS) algorithms, and develop a new graph partitioning algorithm based on hierarchical clustering (GPART) which achieves good ...
Experiments on irregular scientific codes for a variety of meshes show our partitioning algorithms are effective for static and adaptive codes on both sequential and parallel machines. ...
George Karypis at the University of Minnesota for providing the application meshes in our experiments. ...
doi:10.1007/3-540-45574-4_12
fatcat:arh6n3y75netpai2q2bxmxqx4i
Mesh scissoring with minima rule and part salience
2005
Computer Aided Geometric Design
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2016; you can also visit the original URL.
The file type is application/pdf.
Unlike common approaches that segment a mesh using clustering schemes, here we introduce a method that concentrates on the contours for cutting. ...
Subsequently, these open contours are prioritized to select the most salient one. Then, the selected open contour is automatically completed to form a loop around a specific part of the mesh. ...
Acknowledgements The bunny, horse and Igea, and feline models are courtesy of the Stanford Computer Graphics Laboratory, Cyberware, and the Caltech Multi-Res Modeling Group, respectively. ...
doi:10.1016/j.cagd.2005.04.002
fatcat:gqtpav7u4zdf3m5mv7dto3htvi
Easy cross parameterization for articulated shapes
2009
Journal of Zhejiang University: Science A
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2012; you can also visit the original URL.
The file type is application/pdf.
This paper presents a novel interactive system for establishing compatible meshes for articulated shapes. ...
Users can use some sketch-based tools to specify the correspondence in an intuitive and easy way. Then all the other vertex correspondences could be generated automatically. ...
Interactive Graph Cuts for Optimal Boundary & Region Segmentation of Objects in n-d Images. Proc. ICCV, p.105-112. ...
doi:10.1631/jzus.a0820615
fatcat:77ptqdmjr5ctdeegje3typ672e
SnapPaste: an interactive technique for easy mesh composition
2006
The Visual Computer
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2010; you can also visit the original URL.
The file type is application/pdf.
For completeness of our framework, we present an additional simple mesh-cutting tool, adapting the graph-cut algorithm to meshes. ...
In this paper, we introduce a simple and effective user interface for easy composition of 3D mesh-parts for non-professionals. ...
Scheidegger, Shahar Fleishman and Claudio Silva for providing us the code for local triangulation with boundary constraints in our remeshing step. ...
doi:10.1007/s00371-006-0068-5
fatcat:vtepupr4ijhgtl3e7znj5dadpm
« Previous
Showing results 1 — 15 out of 3,397 results