scispace - formally typeset
Open AccessJournal ArticleDOI

An Output-Sensitive Convex Hull Algorithm for Planar Objects

Reads0
Chats0
TLDR
In this paper, a convex hull of a set of n planar convex objects of fixed type m is computed in O(nβ(h,m log h) time.
Abstract
A set of planar objects is said to be of type m if the convex hull of any two objects has its size bounded by 2m. In this paper, we present an algorithm based on the marriage-before-conquest paradigm to compute the convex hull of a set of n planar convex objects of fixed type m. The algorithm is output-sensitive, i.e. its time complexity depends on the size h of the computed convex hull. The main ingredient of this algorithm is a linear method to find a bridge, i.e. a facet of the convex hull intersected by a given line. We obtain an O(nβ(h,m log h)-time convex hull algorithm for planar objects. Here β(h,2)=O(1) and β(h,m) is an extremely slowly growing function. As a direct consequence, we can compute in optimal Θ(n log h) time the convex hull of disks, convex homothets, non-overlapping objects. The method described in this paper also applies to compute lower envelopes of functions. In particular, we obtain an optimal Θ(n log h)-time algorithm to compute the upper envelope of line segments.

read more

Content maybe subject to copyright    Report

HAL Id: inria-00074107
https://hal.inria.fr/inria-00074107
Submitted on 24 May 2006
HAL is a multi-disciplinary open access
archive for the deposit and dissemination of sci-
entic research documents, whether they are pub-
lished or not. The documents may come from
teaching and research institutions in France or
abroad, or from public or private research centers.
L’archive ouverte pluridisciplinaire HAL, est
destinée au dépôt et à la diusion de documents
scientiques de niveau recherche, publiés ou non,
émanant des établissements d’enseignement et de
recherche français ou étrangers, des laboratoires
publics ou privés.
An Output-Sensitive Convex Hull Algorithm for Planar
Objects
Franck Nielsen, Mariette Yvinec
To cite this version:
Franck Nielsen, Mariette Yvinec. An Output-Sensitive Convex Hull Algorithm for Planar Objects.
RR-2575, INRIA. 1995. �inria-00074107�

ISSN 0249-6399
apport
de recherche
INSTITUT NATIONAL DE RECHERCHE EN INFORMATIQUE ET EN AUTOMATIQUE
An Output-Sensitive Convex Hull Algorithm for
Planar Objects
Franck Nielsen, Mariette Yvinec
2575
Mai 1995
PROGRAMME 4


! #"$%%&'%()*,+- ./)102%334)
65798:,
;,<>=@?,A/BDCEGFIHKJ>FL?MONQP2=@<EKFIRSR>FTUEK?VFWAQMM
X!YSZ\[LY>]I^^`_acbdZLe*ZLfgihkj_\l@gm^n]L[\__>fpoqgsrtgsZLu
X!YSZOv_>fX!Ygsrt^w_
d]IxxyZLYf{z_YS_/|}_>YS|}_~uq\\\cb&]IgL\\cb\x,]L[\_/r
:>OL\\
r_fZLyxG]Iu,]IYZLev_|>fSrgsrrS]IgizfSZcey_ZL*f@x*_{g*f}_|/ZLu@ok_>¡}@j,ZL]Iu@
f£¢ZZLev_|>fSrQ}y]LrQgfrQr¤gi¥_!e*ZLjuz_ze@§¦ID¨Q©£u§f}giryx,]Ix*_>YOl/¢_xYS_/r_uqfª]Iu]Is[\ZLYgf}^«e,]Lr_/z
ZLu¬f}_^n]IYYgK]L[\_®e*_>®ZLYS_>¯|ZLuVh°j_/r¤fx,]IY>]Lzgs[L^±fSZ|/ZL^xjfS_{f}V_|/ZLu@ok_>¡`}@jm²ZL]r_>fZL:³
xK]Iu,]IY:|/ZLu@ok_>¡cZLe´v_/|>fSrQZLµ¡´_/zfqxy_:¶¨²·}_]Is[\ZLYgmf}^«girQZLjfxjf¯r_urtgfgmok_/lLg¯¨¸_\¨ygmfSryfg^`_
|ZL^xi_>¡@gmf£z_x*_>uzr:ZLu`f}_4r¤gs¥/_¹`ZLVf}_{|/ZL^xjfS_/z|ZLuqok_¡}qjm¯¨:·p}_{^n]IgmuguV[LYS_zgs_>u@f
ZLf}gsr`]Ii[\ZLYgmf}^ºgir]&gmu_O]IYw^`_>f}Zqz»fSZ¼µuz½]6¾S¿>ÀÂÁOðÄl9g¯¨¸_\¨«]¼¯]L|/_>fwZLf}_Å|ZLuqok_¡
}@jgmu@fS_>YSr_/|>fS_zÆeqÇ][Lgok_>u»mguV_\¨§ÈÇ_`ZLef>]Igmu»]IuÊÉwËG³VÌp˯¹*ÍÏÎ@ÐiÑ\Ò9¹Î®fg^`_|/ZLu@ok_>¡D}@jm
]Is[\ZLYgf}^«®ZLY:xK]Iu,]IY:ZLev_/|fr/¨QÓ_YS_Ìp˯¹*Í¦\ÎÔÕÉ`ËÖLÎQ]IuVzÌË£¹*ÍÏÎVgir!]Iu_>¡@fY_^`_>r¤iZ¢4
[LYSZ¢4gu[nGju|>fgiZLu²¨
r]z´gmYS_/|f|/ZLur_/h°jV_u|/_°lV¢p_|O]Iu»|/ZL^xjfS_×gmuDZLxfgm^n]IاËG³ÐiÑ\Ò¹Î
fgm^w_Æf}V_Æ|ZLuqok_¡½}qjZLzgsr¤Ùr/l|ZLuqok_¡½}ZL^`ZLf}_>fSr/lpuZLu¯Z/ok_YG]Ixxgu[ÊZLe´v_/|>fSr/¨Ú·p}_
^`_f}VZ@zz_r|>Ygme*_z×gmuf}gir:x,]Ix*_>Y]IsrZc]Ixxmgi_rQfZ|/ZL^xjfS_sZ/¢p_>Y_uqok_>sZLx*_/r!ZLVKju|>fgsZLuVr/¨
©£ux,]IYfgs|>jK]IYOlW¢_ZLef>]Igmun]IuwZLxfg^n]I,ØËG³ÐiÑ\Ò9¹Î®fg^`_4]Is[\ZLYgmf}^fSZ×|/ZL^xjfS_f}_pjxx*_Y
_uqok_>sZLx*_ZL:gmu_r_/[L^`_uqfSr/¨
ÛÆÜ°Ý*ޤߧàLá:W â
ZL^xjf>]IfgsZLu,]I[\_ZL^`_>fY@l
â
ZLu@ok_>¡¼}qjm¯lQã{xx*_>Yä!uqok_iZLx*_\l:åjfxjf
r_>ur¤gmfgok_]Ii[\ZLYgmf}^`r/¨
æsç*è¯éêë{èì²íîéïÂð>ñ
ò,óIôöõ,÷,ø>ù®úp÷*û>õyõGüOýIýLø>ù®þ®ÿ

ô

{ýWûù®þ

{þ®óIÿ


,û>õGô

*ÿõGÿûSù

¯ó

þ®ô ø
 !"#%$&'()+*
,
.-)0/12435/7682469
ø>ýOóIôöû
;:"
þ®ô ýWø
4<
ôöõ

ÿ

/ÿ
>=?!"@
Iù¯û
; 
£ÿ
;*A:CB
{ûSô
<EDF@
Iù¯û
;7
¯ú
HG -
ÿ
I<
öõGÿ
>KJ
:õGø>ýOóIôöû
5G
ô

Iù®ôöû
5G L
ù
IG
,,
.-)
ûSþ
M
ø>ýIóOôöû

/þ®ô ýLø
<
ôöõ
/
û
;7N$O-P7/;QPR3;85/I#
;
Lø>ù¯ûSþ®øô ù®ÿ
M)37/
yüIÿ
<
Lÿ¤ù®þ
M
ô

LõGþ®ÿ¤ô
S/T68U;86
V
û
;<
W
Oÿ
/7@
Iù¯û
;7
ÿ
/7A:XB
4ûSô
<EDF'
ûSù®ô ÿ¤þ®þ®ÿ
YG Z[

Iÿ
TJ
:õGø>ýIóOôöû
5G
ô

Iù®ôöû
5G L
ù
IG
Unite´ de recherche INRIA Sophia-Antipolis
2004 route des Lucioles, BP 93, 06902 SOPHIA-ANTIPOLIS Cedex (France)
Te´le´phone : (33) 93 65 77 77 Te´le´copie : (33) 93 65 77 65

Ú 3{%()*,+- 3

3{3{.&`)'% 8:34%S8!%

±%

¯%`
8:! c

¯57,6%33{)*

q

¬
ã{uÅ_ur_^es_z

¸ZLev_frªxG]Iu,]IgmYS_/r9_/r¤fz_f£qx*_{rtgG]f]Igms_z_{

¸_uqok_iZLxx*_
|ZLuqok_>¡´_`z_`z_j¡¼ZLev_>fSr×_/r¤fceyZLYu

_x,]IY¦ID¨

]Iur§|_Y>]Ixx*ZLYfLl*uZLjVrxY

/r_>u@fZLurju
]Is[\ZLYgf}^w_e,]Lr

r¤jY{s_x,]IY>]Lzgs[L^`_^n]IYgG]L[\_>]o@]Iu@f¯|/ZLuhkj

>fS_ x*ZLjY4|I]Ii|>js_>Yp

¸_uqok_iZLxx*_
|ZLuqok_>¡´_z

ju&_>ur_>^ei_z_׳2ZLev_fr{xG]Iuy]IgYS_/rz_fqxy_c

G µ¡

 
]Is[\ZLYgmf}^`_c_r¤f
]Lz]Ixf>]Ifgtl,|
!
¸_rtf
#"
I¯z´gmYS_hkj_rZLuDfS_^xrz_|I]Ii|j!z
$
>xy_>uz
"
G]®ZLgsrz_×K]f]Igms_z_r_>u
fY

/_r^n]Igir×]Ijrr¤gz_K]f>]Igmi_z_

_>uqok_iZLxx*_|/ZLu@ok_>¡´_°¨
%
²_xYgmu|>gx,]Iªgu[LY
&
z´gi_>u@fz_|/_>f
]Is[\ZLYgf}^w_§_r¤fjuV_×^
'
f}VZ@z_gmu

O]IgY_×x*ZLjY|I]Ii|>js_>Yju
($)+*-,
Kly|
.
_/r¤f
#"
I¯zgYS_cju_×¯]L|/_>ffS_
z_
/
¸_uqok_>sZLxx*_|/ZLu@ok_>¡_|/ZLjx,]Iuqf×ju_z´YZLgfS_zZLuu

_°¨
10
ZLjrZLefS_>uZLurju2]Ii[\ZLYgmf}^`_
zZLuqfwK]¼|/ZL^xs_>¡qgf

Å_r¤f`É`ËG³VÌ˯¹*ͤÆÎqÐsÑ\Ò¹Î>¨Õ©¤|>g4Ìp˯¹*Í¦\ÎÅÔ É`ËÖLÎ_>fÌË£¹*ÍÏÎ_/r¤f`ju_
®ZLu|>fgiZLu»hkjg|YSZLgmf_>¡qfY

>^w_>^`_uqfs_>uqfS_^`_>u@fL¨©£_>u2z
$
/|ZLji_h°jV_§uVZLjrx*ZLjokZLurc|I]Ii|>j
s_>Y_>u¶f_^xrZLxfgm^n]IpØËG³ÐiÑ\Ò9¹Î
/
¸_>u@ok_>sZLxxy_|/ZLuqok_¡_wz_zgsrhkj_/r/lQz

¸ZLe´v_>fSrc|ZLuqok_¡_/r
}ZL^`ZLf}

>fgih°j_/r/lz

ZLev_>fSr{uZLu®Y_|/ZLjoqY>]Iu@fr/¨
2
:]^

>f}Zqz_cz
$
|>YgmfS_×zV]Iur|_x,]Ixgs_>Yx*_jf
r
3
]Ixxmgshkj_>Y
4
/[k]Is_>^`_uqf]IjÆ|O]Is|>j²z_
/
¸_uqok_>sZLxx*_r¤jx

>Ygs_>jYS_z_ ®ZLuV|fgiZLur/¨äªuÅx,]IYfgi|j
gi_>YOl²uZLjVr×ZLefS_>uZLurju2]Ii[\ZLYgmf}^`_ZLxfgm^n]I9_>u ØËG³ÐsÑ\Ò¹Îx*ZLjY§|I]Ii|>js_>Y×

¸_uqok_iZLxx*_
r¤jx

>Ygs_>jYS_z_r_/[L^`_uqfSr/¨
5
~àI>Þ
768
Ç
9
/ZL^
'
fYgs_]Ii[\ZLYgmf}^gshkj_°l´äªuqok_>sZLxx*_|ZLuqok_>¡´_°lä!uqok_iZLxx*_r¤jx

Ygs_>jYS_°l
s[\ZLYgf}^w_/r{]LzV]Ixf>]Ifgm®r/¨

Citations
More filters
Journal ArticleDOI

An Algorithmic Toolbox for Network Calculus

TL;DR: This paper presents a class containing the piecewise affine functions which are ultimately pseudo-periodic and can be finitely described, which enables us to propose some algorithms for each of the network calculus operations.
Journal ArticleDOI

An exact and efficient approach for computing a cell in an arrangement of quadrics

TL;DR: It is shown that the coordinates of the singular points in the authors' special projected planar arrangements are roots of quadratic polynomials, which are usually rational and contain at most a single square root.
Proceedings ArticleDOI

On the combinatorial complexity of euclidean Voronoi cells and convex hulls of d-dimensional spheres

TL;DR: The equivalence relationship between additively weighted Voronoi cells and convex hulls of spheres permits us to compute a single additively Weight Vor onoi cel1 in dimension d in worst case optimal time.
Journal ArticleDOI

Guaranteed Bounds on the Kullback–Leibler Divergence of Univariate Mixtures

TL;DR: A fast and generic method that builds algorithmically closed-form lower and upper bounds on the entropy, the cross-entropy and the KL divergence of univariate mixtures is presented.
Journal ArticleDOI

Fast stabbing of boxes in high dimensions

TL;DR: A fast precision-sensitive heuristic for stabbing S whose quality does not depend on the input size is obtained and an optimal output-sensitive algorithm for nding a minimal-size optimal stabbing point-set of intervals is described.
References
More filters
Journal ArticleDOI

Time bounds for selection

TL;DR: The number of comparisons required to select the i-th smallest of n numbers is shown to be at most a linear function of n by analysis of a new selection algorithm-PICK.
Proceedings ArticleDOI

Applications of random sampling in computational geometry, II

TL;DR: Asymptotically tight bounds for a combinatorial quantity of interest in discrete and computational geometry, related to halfspace partitions of point sets, are given.
Book

Davenport-Schinzel sequences and their geometric applications

TL;DR: A close to linear bound on the maximum length of Davenport--Schinzel sequences enable us to derive sharp bounds on the combinatorial structure underlying various geometric problems, which in turn yields efficient algorithms for these problems.
Journal ArticleDOI

The maximum numbers of faces of a convex polytope

Peter McMullen
- 01 Dec 1970 - 
TL;DR: For convex polytopes, the maximum possible number of faces of a d-polytope with v vertices is achieved by a cyclic polytope C(v, d) as discussed by the authors.
Related Papers (5)
Frequently Asked Questions (2)
Q1. What contributions have the authors mentioned in the paper "An output-sensitive convex hull algorithm for planar objects" ?

HAL this paper is a multi-disciplinary open access archive for the deposit and dissemination of scientific research documents, whether they are published or not. 

®ZLY ] r _ f 1ZL :x*ZLg uqfSrFE:Ë 0LÎ öÄ , 32n¾ Ä , ´Äy > ) ( Ä') , ´Ä ( ($)W¿ ,KÀ8*´ÃP À8*VÄ'); , ´Än¾S¿>ÀÂÁOÃ°Ä ); a !, 9 +*VÁ[ öÄ3, ¼¾ Ä , ´Ä} > ) ( Ä ); , ´Äy &,K¿ WÀsÃD , À8*VÄ , k¿ ) qÃD % +*VÁ 0; 1 p 32 , ´Ä * % $ +*$* )!, ¾ Ä ($)WÀ8*-, ); , ´Ä ¾S¿>ÀÂÁOÃ°Ä ) & ¶Ë ÎM !, 9 1 40 32 , ´Ä * 0v$ +*$* )!, ¾ Ä (-)LÀ *-, ); 2, ´Ä ¾ ¿ À¯ÁIÃkÄ} !, 9·p¢ Z ZLe´v _ |>fSrpÉ ]