Cited By
View all- Hao YLien JMcCann JYao L(2019)Computational laser forming origami of convex surfacesProceedings of the 3rd Annual ACM Symposium on Computational Fabrication10.1145/3328939.3329006(1-11)Online publication date: 16-Jun-2019
Convex surface decomposition
Pages 447 - 448
Abstract
No abstract available.
References
[1]
B. Chazelle, D. Dobkin, N. Shouraboura, A. Tal. Strategzes for Polyhedral Surface Decomposition: An Experimental Study, Eleventh Annual ACM Symposium on Computational Geometry, June 1995.
[2]
D. Dobkin, A. Tal. GASP- An Anzmatzon System for Computational Geometry, Sixth Canadian Conference on Computational Geometry, August 1994.
[3]
A. Tal, D. Dobkin. GASP - A System for Visualizing Geometric Algorithms, Visualization '94, October 1994.
Recommendations
Convex hulls of spheres and convex hulls of disjoint convex polytopes
Given a set @S of spheres in E^d, with d>=3 and d odd, having a constant number of m distinct radii @r"1,@r"2,...,@r"m, we show that the worst-case combinatorial complexity of the convex hull of @S is @Q(@__ __"1"=<"i"<>"j"=<"mn"in"j^@__ __^d^2^@__ __), ...
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 ...
Convex hulls of spheres and convex hulls of convex polytopes lying on parallel hyperplanes
SoCG '11: Proceedings of the twenty-seventh annual symposium on Computational geometryGiven a set Σ of spheres in Ed, with d≥3 and d odd, having a fixed number of m distinct radii ρ1,ρ2,...,ρm, we show that the worst-case combinatorial complexity of the convex hull CHd(Σ) of Σ is Θ(Σ{1≤i≠j≤m}ninj⌊ d/2 ⌋), where ni is the number of ...
Comments
Information & Contributors
Information
Published In
Copyright © 1995 ACM.
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]
Sponsors
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 01 September 1995
Check for updates
Qualifiers
- Article
Conference
SCG95: 11th ACM Symposium on Computational Geometry
June 5 - 7, 1995
British Columbia, Vancouver, Canada
Acceptance Rates
SCG '95 Paper Acceptance Rate 59 of 129 submissions, 46%;
Overall Acceptance Rate 625 of 1,685 submissions, 37%
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- View Citations1Total Citations
- 295Total Downloads
- Downloads (Last 12 months)21
- Downloads (Last 6 weeks)4
Reflects downloads up to 26 Jul 2024
Other Metrics
Citations
Cited By
View all- Hao YLien JMcCann JYao L(2019)Computational laser forming origami of convex surfacesProceedings of the 3rd Annual ACM Symposium on Computational Fabrication10.1145/3328939.3329006(1-11)Online publication date: 16-Jun-2019
View Options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in