Науковий вісник НГУ

Graham algorithm development for constructing convex hulls of bitmapped objects

  • Print
User Rating:  / 0
PoorBest 
Details
Category: IT technologies
Last Updated on Saturday, 05 January 2013 16:45
Published on Saturday, 05 January 2013 16:45
Hits: 3674
SocButtons v1.4

 

Authors: T.A. Ruzova
 
It has been analysed the problems occuring while using Graham algorithm for constructing convex hulls of bitmapped objects. It is proposed the algorithm of making hulls for geometrically-complex objects improvement which allows avoiding errors caused by discrete representation of contour. Proposed approach can be used for designing software concerning wide range of problems.
Files:
2010_11-12 Ruz
Date 2012-12-14 Filesize 371.68 KB Download 1180
 

Visitors

6307049
Today
This Month
All days
840
42241
6307049

Guest Book

If you have questions, comments or suggestions, you can write them in our "Guest Book"

Registration data

ISSN (print) 2071-2227,
ISSN (online) 2223-2362.
Journal was registered by Ministry of Justice of Ukraine.
Registration number КВ No.17742-6592PR dated April 27, 2011.

Contacts

D.Yavornytskyi ave.,19, pavilion 3, room 24-а, Dnipro, 49005
Tel.: +38 (056) 746 32 79.
e-mail: This email address is being protected from spambots. You need JavaScript enabled to view it.
You are here: Home Archive by field of science IT technologies Graham algorithm development for constructing convex hulls of bitmapped objects
Copyright © 2024 Науковий вісник НГУ. All Rights Reserved. Designed by JoomlArt.com. Joomla! is Free Software released under the GNU General Public License.