Boolean-based operation on overlapping CL paths for 3D models

Jui Pin Hung, Yuan Lung Lai

研究成果: Article

1 引文 (Scopus)

摘要

A 3D model can be machined in sections by dividing with cutting slices vertical to the z-axis. This paper introduces a Boolean-based algorithm for planar profiles, which is a frequent implementation for overlapping elimination in CL paths generation. In the proposed algorithm, the profiles can be convex or concave, with or without islands. It is available for general planar profiles on contouring and pocketing machining. This algorithm searches for all intervals split by intersections of complicate planar profiles directly and transforms 2D transversal intersection problems into 1D interval identifications. It uses a simple but efficient odd-even determination based on interval-linked sets by tracking the intersections along the governing profile. Depending on the operation of Boolean union, intersection, and difference between two profiles, the solutions can be obtained under the same manipulation procedures. This proposed algorithm can be easily adapted to Boolean operations between regions composed of general closed profiles and be implemented on computerised CAD/CAM systems. Examples with various multiple profiles are demonstrated.

原文English
頁(從 - 到)379-392
頁數14
期刊International Journal of Production Research
50
發行號2
DOIs
出版狀態Published - 2012 一月 15

指紋

Computer aided manufacturing
Computer aided design
Machining
Computer systems
Overlapping
Manipulation

All Science Journal Classification (ASJC) codes

  • Strategy and Management
  • Management Science and Operations Research
  • Industrial and Manufacturing Engineering

引用此文

@article{4970d7e995d94e7b8564dbbe0f0c2f76,
title = "Boolean-based operation on overlapping CL paths for 3D models",
abstract = "A 3D model can be machined in sections by dividing with cutting slices vertical to the z-axis. This paper introduces a Boolean-based algorithm for planar profiles, which is a frequent implementation for overlapping elimination in CL paths generation. In the proposed algorithm, the profiles can be convex or concave, with or without islands. It is available for general planar profiles on contouring and pocketing machining. This algorithm searches for all intervals split by intersections of complicate planar profiles directly and transforms 2D transversal intersection problems into 1D interval identifications. It uses a simple but efficient odd-even determination based on interval-linked sets by tracking the intersections along the governing profile. Depending on the operation of Boolean union, intersection, and difference between two profiles, the solutions can be obtained under the same manipulation procedures. This proposed algorithm can be easily adapted to Boolean operations between regions composed of general closed profiles and be implemented on computerised CAD/CAM systems. Examples with various multiple profiles are demonstrated.",
author = "Hung, {Jui Pin} and Lai, {Yuan Lung}",
year = "2012",
month = "1",
day = "15",
doi = "10.1080/00207543.2010.537705",
language = "English",
volume = "50",
pages = "379--392",
journal = "International Journal of Production Research",
issn = "0020-7543",
publisher = "Taylor and Francis Ltd.",
number = "2",

}

Boolean-based operation on overlapping CL paths for 3D models. / Hung, Jui Pin; Lai, Yuan Lung.

於: International Journal of Production Research, 卷 50, 編號 2, 15.01.2012, p. 379-392.

研究成果: Article

TY - JOUR

T1 - Boolean-based operation on overlapping CL paths for 3D models

AU - Hung, Jui Pin

AU - Lai, Yuan Lung

PY - 2012/1/15

Y1 - 2012/1/15

N2 - A 3D model can be machined in sections by dividing with cutting slices vertical to the z-axis. This paper introduces a Boolean-based algorithm for planar profiles, which is a frequent implementation for overlapping elimination in CL paths generation. In the proposed algorithm, the profiles can be convex or concave, with or without islands. It is available for general planar profiles on contouring and pocketing machining. This algorithm searches for all intervals split by intersections of complicate planar profiles directly and transforms 2D transversal intersection problems into 1D interval identifications. It uses a simple but efficient odd-even determination based on interval-linked sets by tracking the intersections along the governing profile. Depending on the operation of Boolean union, intersection, and difference between two profiles, the solutions can be obtained under the same manipulation procedures. This proposed algorithm can be easily adapted to Boolean operations between regions composed of general closed profiles and be implemented on computerised CAD/CAM systems. Examples with various multiple profiles are demonstrated.

AB - A 3D model can be machined in sections by dividing with cutting slices vertical to the z-axis. This paper introduces a Boolean-based algorithm for planar profiles, which is a frequent implementation for overlapping elimination in CL paths generation. In the proposed algorithm, the profiles can be convex or concave, with or without islands. It is available for general planar profiles on contouring and pocketing machining. This algorithm searches for all intervals split by intersections of complicate planar profiles directly and transforms 2D transversal intersection problems into 1D interval identifications. It uses a simple but efficient odd-even determination based on interval-linked sets by tracking the intersections along the governing profile. Depending on the operation of Boolean union, intersection, and difference between two profiles, the solutions can be obtained under the same manipulation procedures. This proposed algorithm can be easily adapted to Boolean operations between regions composed of general closed profiles and be implemented on computerised CAD/CAM systems. Examples with various multiple profiles are demonstrated.

UR - http://www.scopus.com/inward/record.url?scp=84859972340&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84859972340&partnerID=8YFLogxK

U2 - 10.1080/00207543.2010.537705

DO - 10.1080/00207543.2010.537705

M3 - Article

AN - SCOPUS:84859972340

VL - 50

SP - 379

EP - 392

JO - International Journal of Production Research

JF - International Journal of Production Research

SN - 0020-7543

IS - 2

ER -