Efficient convex hull computation for planar freeform curves

Yong Joon Kim, Jieun Lee, Myung Soo Kim, Gershon Elber

Research output: Contribution to journalArticlepeer-review


We present an efficient real-time algorithm for computing the precise convex hulls of planar freeform curves. For this purpose, the planar curves are initially approximated with G1-biarcs within a given error bound ε in a preprocessing step. The algorithm is based on an efficient construction of approximate convex hulls using circular arcs. The majority of redundant curve segments can be eliminated using simple geometric tests on circular arcs. In several experimental results, we demonstrate the effectiveness of the proposed approach, which shows the performance improvement in the range of 200300 times speed up compared with the previous results (Elber et al., 2001) [8].

Original languageEnglish
Pages (from-to)698-705
Number of pages8
JournalComputers and Graphics (Pergamon)
Issue number3
StatePublished - Jun 2011


  • Biarcs
  • Convex hull
  • Culling
  • Efficient algorithm
  • Planar freeform curves
  • Upper envelope

All Science Journal Classification (ASJC) codes

  • Software
  • General Engineering
  • Signal Processing
  • Human-Computer Interaction
  • Computer Vision and Pattern Recognition
  • Computer Graphics and Computer-Aided Design

Cite this