A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is `application/pdf`

.

## Filters

##
###
Incremental Convex Hull as an Orientation to Solving theShortest Path Problem

2012
*
International Journal of Information and Electronics Engineering
*

We find

doi:10.7763/ijiee.2012.v2.181
fatcat:otjhzqktfjgn3djoqp3urloj6m
*the*Euclidean shortest path in*the**polygon*between*a*and b. In this paper, an efficient algorithm based*on*incremental*convex**hulls*is presented. ...*The*following problem is very classical in motion planning: Let*a*and b be two vertices*of**a**polygon*and P (Q, respectively) be*the*polyline formed by vertices*of**the**polygon*from*a*to b (from b to*a*, ... Then 1) u* is an extreme vertex*of**the**convex**hull**of*{u*}*Y***. 2)*The*first edge (if viewed from u*)*of**the*clock-wise*convex**hull**of*{u*}*Y*** is*a*link to*X*and*Y*. ...##
###
A Hybrid Convex Hull Algorithm for Fingertips Detection

2016
*
Indian Journal of Science and Technology
*

Novelty/Improvement:

doi:10.17485/ijst/2016/v9i28/97821
fatcat:vzbthxgedngsrghyoyz366t4da
*The*hybrid*convex**hull*algorithm offers*a*direct way to detect*the**convex**hull**of**the*original image without edge detection process. ... Methodology: In this paper, we suggest to reduce*the*computational resources by leveraging*on*two proven algorithms and techniques in order to extract*the**convex**hull*vertices directly from*a*binary image ... As p 0 is*the*rightmost top vertex*of**the**convex**hull*, let l be*a*point*on*L, ∀l∈L, l ≠ p 0 , p 0x <l*x*≤ M*x*and l*y*= M*y*, l∉S. Thus, L is*the*exterior line*of**the**convex**polygon*. ...##
###
A Syudy on Applications of Convex Hull Algorithm in the SPH

SPH에서의 Convex Hull 알고리즘 적용연구

2011
*
Journal of the Korea Institute of Military Science and Technology
*

SPH에서의 Convex Hull 알고리즘 적용연구

In this study,

doi:10.9766/kimst.2011.14.2.313
fatcat:gkbhpacy3vch3feer6656zhuwu
*convex**hull*algorithm is presented as an improved method to eliminate this artifact.*A**convex**hull*is*the*smallest*convex**set*that contains*a*certain*set**of*points or*a**polygon*. ...*The*selected candidate neighbours*set*are mapped into*the*new space by an inverse square mapping, and extract*a**convex**hull*.*The*neighbours are selected from*the*shell*of**the**convex**hull*. ... 구간별 particle*set*가)*A*구간*A*구간의 구성 particle은 Fig. 3에서 Ymax를 가진 P1 particle의*X*data 이상의*X*값을 가지고, Xmax를 갖는 P2 particle의*Y*값을 초과하는*Y*값을 가지는 particle 집합으로 이루어진다. ...##
###
On a partition into convex polygons

1996
*
Discrete Applied Mathematics
*

In this paper we study

doi:10.1016/0166-218x(94)00120-3
fatcat:nrsgafwyebgj3lnb7h6c33c4ee
*the*problem*of*partitioning point*sets*in*the*plane so that each equivalence class is*a**convex**polygon*with some conditions*on**the*intersection properties*of*such*sets*. ... We also estimate*the*maximum*of**the*minimum number*of**sets*in*a*partition into empty*convex**polygons*, over all*sets**of*n points. ... Acknowledgements*The*author would like to thank Professor David Avis for his valuable suggestions and*the*referee for his helpful comments. ...##
###
Optimum harvesting area of convex and concave polygon field for path planning of robot combine harvester

2019
*
Intelligent Service Robotics
*

This paper presents an optimum harvesting area

doi:10.1007/s11370-018-00273-4
fatcat:ai46xpfxlnaklpunxnn3mtaafa
*of**a**convex*and concave*polygon*for*the*path planning*of**a*robot combine harvester. ... Therefore,*a*suitable N-*polygon*algorithm and split*of**convex**hull*and cross-point method for determining*the*optimum harvesting area for path planning are proposed, which reduce*the*crop losses in*the*...*X*H*Y*H cos π 2 − ϕ − sin π 2 − ϕ sin π 2 − ϕ cos π 2 − ϕ*a*b +*X*i*Y*i (1) Incremental*convex**hull*algorithm*The**convex**hull**of**a**set**of*points Q is defined as*the*smallest*convex**polygon*P that contains ...##
###
A Moment-Based Shape Similarity Measurement for Areal Entities in Geographical Vector Data

2018
*
ISPRS International Journal of Geo-Information
*

Combined with

doi:10.3390/ijgi7060208
fatcat:tyz4z5empvdxxesgnv6bm6cf3i
*convex**hull*and local moment invariants,*polygons*can be represented by*convex**hull*moment invariant curves. ...*The*shape context descriptor extracts*a*global feature for each point*on**the*boundary*of**polygons*. ... If*X*is*convex**hull**of**polygon*C, it can be represented as*a**set**of*vertices {P 1 , P 2 , . . . P n }. ...##
###
PLANAR STRONG VISIBILITY

2003
*
International journal of computational geometry and applications
*

Testing

doi:10.1142/s0218195903001116
fatcat:ihsxgnkyizehver76onkbi2kny
*the*strong visibility*of*two points in*a**polygon*. 2. Finding*the*strong*convex**hull**of**a*point*set*or*polygon*. 3. Constructing*the*strong kernel*of**a**polygon*. 4. ... Strong visibility is*a*generalization*of*standard visibility, defined with respect to*a*fixed*set**of*line orientations. ...*On**the*other hand, since S-*hull*(P ) is*convex*, and Q is*the*minimal*convex**set*containing P , we have Q ⊆ S-*hull*(P ); hence, S-*hull*(Q) ⊆ S-*hull*(P ). ...##
###
Covering Polygons by Min-Area Convex Polygons
[article]

2019
*
arXiv
*
pre-print

We show that this process has

arXiv:1912.03429v2
fatcat:qhx7yi6ebbcmdc7clbeu3oxkhq
*a*unique output, which is*a*cover*of**the*input*polygons*by*a**set**of*disjoint*convex**polygons*,*of*total minimum area. ... Given*a**set**of*disjoint simple*polygons*σ_1, ..., σ_n,*of*total complexity N, consider*a*convexification process that repeatedly replaces*a**polygon*by its*convex**hull*, and any two (by now*convex*)*polygons*... For*a**set**of**polygons*U, let CH(U) = CH ∪ σ∈U σ be*the*combined*convex**hull**of*all*the**polygons**of*U. Basic properties*of**convex*-*hulls*Lemma 3.1. ...##
###
CudaChain: an alternative algorithm for finding 2D convex hulls on the GPU

2016
*
SpringerPlus
*

We at last obtain

doi:10.1186/s40064-016-2284-4
pmid:27350927
pmcid:PMC4899387
fatcat:h466u4vcubbilkbfxcsfhwqh7y
*the*expected*convex**hull**of**the*input points by calculating*the**convex**hull**of**the*simple*polygon*. ...*The*proposed algorithm consists*of*two stages: (1) two rounds*of*preprocessing performed*on**the*GPU and (2)*the*finalization*of*calculating*the*expected*convex**hull**on**the*CPU. ...*The*author is grateful to*the*anonymous referee for helpful comments that improve this paper, especially for pointing out*the*references Akl (1984) and Nakagawa et al. (2009) . ...##
###
Creating Star Worlds – Modelling Concave Obstacles for Reactive Motion Planning
[article]

2022
*
arXiv
*
pre-print

*The*algorithm is based

*on*two novel concepts presented here, namely admissible kernel and starshaped

*hull*with specified kernel, which are closely related to

*the*notion

*of*starshaped

*hull*. ...

*The*utilization

*of*

*the*proposed method is illustrated with examples

*of*

*a*robot operating in

*a*2D workspace using

*a*harmonic potential field approach in combination with

*the*developed algorithm. ... For

*a*

*convex*

*set*,

*A*conv ,

*the*extended region

*of*

*the*starshaped

*hull*with specified kernel K is based

*on*

*the*

*convex*

*hull*

*of*

*the*kernel points and their corresponding points

*of*tangency. ...

##
###
Convex Hulls on Cellular Spaces: Spatial Computing on Cellular Automata

2011
*
2011 Fifth IEEE Conference on Self-Adaptive and Self-Organizing Systems Workshops
*

Taking

doi:10.1109/sasow.2011.14
dblp:conf/saso/MaignanG11
fatcat:wwzxwyw4qzc6bisgpbd6vox2yy
*a*spatial computing point*of*view, we present*a*cellular automata rule that constructs*the*discrete*convex**hull**of*arbitrary*set**of*seeds in infinite spaces. ... In*the*cellular automata domain,*the*discrete*convex**hull*computation rules proposed until now only deal with*a*connected*set**of*seeds in infinite space, or with distant*set**of*seeds in finite space. ... Adamatzky who pointed us firstly to*the**convex**hull*problem, which was*the*starting point*of*this work, and secondly to Gabriel graphs, when we showed him our particular graph and its properties. ...##
###
AN EFFICIENT ALGORITHM FOR THE CONVEX HULL OF PLANAR SCATTERED POINT SET

2012
*
The International Archives of the Photogrammetry, Remote Sensing and Spatial Information Sciences
*

Computing

doi:10.5194/isprsarchives-xxxix-b2-63-2012
fatcat:a4bfrpxkjndq7jfgglucgiojsu
*the**convex**hull**of**a*point*set*is requirement in*the*GIS applications. ... This paper studies*on**the*problem*of*minimum*convex**hull*and presents an improved algorithm for*the*minimum*convex**hull**of*planar scattered point*set*. ...*The**convex**hull**of**a**set*Q*of*points is*the*smallest*convex**polygon*P for which each point in Q is either*on**the*boundary*of*P or in its interior (Cormen et al., 2009) . ...##
###
Reduction of metabolic models by polygons optimization method applied to Bioethanol production with co-substrates

2014
*
IFAC Proceedings Volumes
*

Different

doi:10.3182/20140824-6-za-1003.01037
fatcat:ykogi7mxlbfnhgl5g6qvr6kzzy
*polygons*are tested to conjointly minimize*the*squared error (*convex**hull*-experimental data) and maximize*the**convex**hull*area in order to reduce*the**set**of*metabolic reactions involved in*the*... This paper proposes*a*new methodology for*the*reduction*of*metabolic networks based*on**the*concept*of**convex**hull*by optimization methods. ... YA implies*the*reduction*of**convex**hull*by (i) selecting*the*active modes (AMs) that form*the*greatest triangle and (ii) increasing*the*area*of**the**convex**hull*by adding*one*vertex (AMs) at*a*time to achieve ...##
###
Minimum convex partition of a constrained point set

2001
*
Discrete Applied Mathematics
*

*A*

*convex*partition with respect to

*a*point

*set*S is

*a*planar subdivision whose vertices are

*the*points

*of*S, where

*the*boundary

*of*

*the*unbounded outer face is

*the*boundary

*of*

*the*

*convex*

*hull*

*of*S, and ... In this paper, we will present

*a*polynomial time algorithm to ÿnd

*a*minimum

*convex*partition with respect to

*a*point

*set*S where S is constrained to lie

*on*

*the*boundaries

*of*

*a*ÿxed number

*of*nested

*convex*... Acknowledgements

*The*authors wish to thank

*the*anonymous referees for their suggestions and corrections to this paper. ...

##
###
Finding the convex hull of a simple polygon

1983
*
Journal of Algorithms
*

It is well known that

doi:10.1016/0196-6774(83)90013-5
fatcat:nqvv73h325batkmdjbuosk4lmy
*the**convex**hull**of**a**set**of*n points in*the*plane can be found by an algorithm having worst-case complexity O(nlog n). ...*A*short linear-time algorithm for finding*the**convex**hull*when*the*points form*the*(ordered) vertices*of**a*simple (i.e., non-self-intersecting)*polygon*is given. ... ACKNOWLEDGMENTS We are grateful to Joseph G'Rourke and Godftied Toussaint whose careful reading*of*an earlier draft uncovered an error in our paper. ...
« Previous

*Showing results 1 — 15 out of 17,860 results*