NDLI: Heuristics for estimating contact area of supports in layered manufacturing

Please wait, while we are loading the content...

Multipattern string matching with q-grams

Cache-efficient string sorting using copying

Cache-Friendly implementations of transitive closure

Algorithms for dynamic multicast key distribution

Partitioning planar graphs with costs and weights

Heuristics for estimating contact area of supports in layered manufacturing

A dynamic topological sort algorithm for directed acyclic graphs

JEA Special Section

The “real” approximation factor of the MST heuristic for the minimum energy broadcasting

A faster branch-and-bound algorithm for the test-cover problem based on set-covering techniques

A framework for probabilistic numerical evaluation of sensor networks: A case study of a localization protocol

GRASP with path relinking for the weighted MAXSAT problem

Implementing minimum cycle basis algorithms

Rectangle covers revisited computationally

Algorithms for pure Nash equilibria in weighted congestion games

Partitioning graphs to speedup Dijkstra's algorithm

Integrating coordinated checkpointing and recovery mechanisms into DSM synchronization barriers

Heuristics for estimating contact area of supports in layered manufacturing

Content Provider	ACM Digital Library
Author	Ilinkin, Ivayio Janardan, Ravi Smid, Michiel Johnson, Eric Castillo, Paul Schwerdt, Jrg
Copyright Year	2007
Abstract	Layered manufacturing is a technology that allows physical prototypes of three-dimensional(3D) models to be built directly from their digital representation, as a stack of two-dimensional(2D) layers. A key design problem here is the choice of a suitable direction in which the digital model should be oriented and built so as to minimize the area of contact between the prototype and temporary support structures that are generated during the build. Devising an efficient algorithm for computing such a direction has remained a difficult problem for quite some time. In this paper, a suite of efficient and practical heuristics is presented for estimating the minimum contact area. Also given is a technique for evaluating the quality of the estimate provided by any heuristic, which does not require knowledge of the (unknown and hard-to-compute) optimal solution; instead, it provides an indirect upper bound on the quality of the estimate via two relatively easy-to-compute quantities. The algorithms are based on various techniques from computational geometry, such as ray-shooting, convex hulls, boolean operations on polygons, and spherical arrangements, and have been implemented and tested. Experimental results on a wide range of real-world models show that the heuristics perform quite well in practice.
File Format	PDF
ISSN	10846654
e-ISSN	10846654
DOI	10.1145/1187436.1210589
Journal	Journal of Experimental Algorithmics (JEA)
Volume Number	11
Language	English
Publisher	Association for Computing Machinery (ACM)
Publisher Date	2007-02-09
Publisher Place	New York
Access Restriction	One Nation One Subscription (ONOS)
Subject Keyword	Computational geometry Algorithm implementation and testing
Content Type	Text
Resource Type	Article
Subject	Theoretical Computer Science

Central Library (ISO-9001:2015 Certified)
Indian Institute of Technology Kharagpur
Kharagpur, West Bengal, India | PIN - 721302

See location in the Map
03222 282435
Mail: support@ndl.gov.in

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in