Convex hull of a planar set of straight and circular line segments

Yong Yue; J. L. Murray; J. R. Corney; D. E.R. Clark

doi:10.1108/02644409910304086

Convex hull of a planar set of straight and circular line segments

Yong Yue, J. L. Murray, J. R. Corney, D. E.R. Clark

Research output: Contribution to journal › Article › peer-review

8 Citations (Scopus)

Abstract

The problem of constructing the convex hull of a set of points and of curvilinear segments arises in many applications of geometric analysis. Although there has been much work on algorithms for the convex hull of a finite point set, there has been less on methods for dealing with circular line segments and the implementation issues. This paper describes a new method for finding the convex hull of a planar set of straight and circular line segments. It then concentrates on the implementation of the algorithm.

Original language	English
Pages (from-to)	858-875
Number of pages	18
Journal	Engineering Computations (Swansea, Wales)
Volume	16
Issue number	8
DOIs	https://doi.org/10.1108/02644409910304086
Publication status	Published - 1999
Externally published	Yes

Access to Document

10.1108/02644409910304086

Cite this

Yue, Y., Murray, J. L., Corney, J. R., & Clark, D. E. R. (1999). Convex hull of a planar set of straight and circular line segments. Engineering Computations (Swansea, Wales), 16(8), 858-875. https://doi.org/10.1108/02644409910304086

@article{991137785f53461d99a17143a9b8cd0d,

title = "Convex hull of a planar set of straight and circular line segments",

abstract = "The problem of constructing the convex hull of a set of points and of curvilinear segments arises in many applications of geometric analysis. Although there has been much work on algorithms for the convex hull of a finite point set, there has been less on methods for dealing with circular line segments and the implementation issues. This paper describes a new method for finding the convex hull of a planar set of straight and circular line segments. It then concentrates on the implementation of the algorithm.",

author = "Yong Yue and Murray, {J. L.} and Corney, {J. R.} and Clark, {D. E.R.}",

year = "1999",

doi = "10.1108/02644409910304086",

language = "English",

volume = "16",

pages = "858--875",

journal = "Engineering Computations (Swansea, Wales)",

issn = "0264-4401",

number = "8",

}

TY - JOUR

T1 - Convex hull of a planar set of straight and circular line segments

AU - Yue, Yong

AU - Murray, J. L.

AU - Corney, J. R.

AU - Clark, D. E.R.

PY - 1999

Y1 - 1999

N2 - The problem of constructing the convex hull of a set of points and of curvilinear segments arises in many applications of geometric analysis. Although there has been much work on algorithms for the convex hull of a finite point set, there has been less on methods for dealing with circular line segments and the implementation issues. This paper describes a new method for finding the convex hull of a planar set of straight and circular line segments. It then concentrates on the implementation of the algorithm.

AB - The problem of constructing the convex hull of a set of points and of curvilinear segments arises in many applications of geometric analysis. Although there has been much work on algorithms for the convex hull of a finite point set, there has been less on methods for dealing with circular line segments and the implementation issues. This paper describes a new method for finding the convex hull of a planar set of straight and circular line segments. It then concentrates on the implementation of the algorithm.

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

U2 - 10.1108/02644409910304086

DO - 10.1108/02644409910304086

M3 - Article

AN - SCOPUS:0033279801

SN - 0264-4401

VL - 16

SP - 858

EP - 875

JO - Engineering Computations (Swansea, Wales)

JF - Engineering Computations (Swansea, Wales)

IS - 8

ER -

Convex hull of a planar set of straight and circular line segments

Abstract

Access to Document

Other files and links

Cite this