arrow
Return

An offset algorithm for polyline curves

delete2007-04-01
delete36
delete
OA
AI
X
Xu-Zheng Liu *
雍
雍俊海 (Jun‐Hai Yong)
J
Jiaguang Sun
DOI:10.1016/j.compind.2006.06.002delete
deleteOriginal
deleteShare
deleteSave
View PDF
Abstract

Abstract

En 中文
Polyline curves which are composed of line segments and arcs are widely used in engineering applications. In this paper, a novel offset algorithm for polyline curves is proposed. The offset algorithm comprises three steps. Firstly, the offsets of all the segments of polyline curves are calculated. Then all the offsets are trimmed or joined to build polyline curves that are called untrimmed offset curves. Finally, a clipping algorithm is applied to the untrimmed offset curves to yield the final results. The offset algorithm can deal with polyline curves that are self-intersection, overlapping or containing small arcs. The new algorithm has been implemented in a commercial system TiOpenCAD 8.0 and its reliability is verified by a great number of examples. (c) 2006 Elsevier B.V. All rights reserved.
Keywords:
polyline curve
offset curve
clipping algorithm
AI Summary

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.

Journal

Computers in Industry cover
Computers in Industry
IF:
9.1
Papers:
2.9K
Citations:
1.1W

Organization

No organization information available
Cited Papers

Cited Papers

Suppression of Low-Frequency Shock Oscillations over Boundary Layers by Repetitive Laser Pulse Energy Deposition
err2016-04-27
err0
errOAAI
errAkira Iwakawa; Tatsuro Shoda; Hoang Pham; Takahiro Tamba; Akihiro Sasoh
errShare
errSave
errShare
errSave
errShare
errSave
Hexaaquadodeca-μ-bromo-octahedro-hexatantalum bromide chloride octahydrate
err2002-05-11
err0
PREAI
errMarija Vojnović; Berislav Perić; Pavica Planinić; Gerald Giester; Nevenka Brničević
errShare
errSave
Swift and stable polygon growth and broken line offset
err1998-09-01
err15
PREAI
errKalmanovich, G; Nisnevich, G
errShare
errSave
researcher View more