scholarly journals Optimizing the Maximal Perturbation in Point Sets while Preserving the Order Type

2019 ◽  
Vol 24 (4) ◽  
pp. 97
Author(s):  
Luis Gerardo de la Fraga ◽  
Heriberto Cruz Hernández

Recently a new kind of fiducial marker based on order type (OT) has been proposed. Using OT one can unequivocally identify a set of points through its triples of point orientation, and therefore, there is no need to use metric information. These proposed order type tags (OTTs) are invariant under a projective transformation which allows identification of them directly from a photograph. The magnitude of noise in the point positions that a set of points can support without changing its OT, is named the maximal perturbation (MP) value. This value represents the maximal displacement that any point in the set can have in any direction without changing the triplet’s orientation in the set. A higher value of the MP makes an OTT instance more robust to perturbations in the points positions. In this paper, we address the problem of how to improve the MP value for sets of points. We optimize “by hand” the MP for all the 16 subsets of points in the set of OTs composed of six points, and we also propose a general algorithm to optimize all the sets of OTs composed of six, seven, and eight points. Finally, we show several OTTs with improved MP values, and their use in an augmented reality application.

2017 ◽  
Vol 121 ◽  
pp. 04001 ◽  
Author(s):  
Cătălin Gheorghe Amza ◽  
Aurelian Zapciu ◽  
Diana Popescu ◽  
Octav Teodorescu

2007 ◽  
Vol 17 (04) ◽  
pp. 297-304 ◽  
Author(s):  
OLIVIER DEVILLERS ◽  
VIDA DUJMOVIĆ ◽  
HAZEL EVERETT ◽  
SAMUEL HORNUS ◽  
SUE WHITESIDES ◽  
...  

Given a set of n points in the plane, we consider the problem of computing the circular ordering of the points about a viewpoint q and efficiently maintaining this ordering information as q moves. In linear space, and after O(n log n) preprocessing time, our solution maintains the view at a cost of O( log n) amortized time (resp.O( log 2 n) worst case time) for each change. Our algorithm can also be used to maintain the set of points sorted according to their distance to q .


Author(s):  
Dylan Juliano Santoso ◽  
William Silvano Angga ◽  
Frederick Silvano ◽  
Hanzel Edgar Samudera Anjaya ◽  
Fairuz Iqbal Maulana ◽  
...  

Sign in / Sign up

Export Citation Format

Share Document