By Topic

The Application Based on Bracket Method for Planar Computational Geometry

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Ying Chen ; Dept. of Basic Sci., Beijing Electron. Sci. & Technol. Inst., Beijing, China ; Yaogang Du ; Chunming Yuan

In this paper, we study two basic problems about planar computational geometry with bracket method. One is how to judge whether a point is inside a given convex polygon, the other is how to compute the convex hull of planar points. The key idea of our criteria is to use the bracket, which is made up of the homogeneous coordinates for points, to carry out the judgment and computation. Experiments show that the proposed method is significantly efficient and robust.

Published in:

Computational Sciences and Optimization, 2009. CSO 2009. International Joint Conference on  (Volume:1 )

Date of Conference:

24-26 April 2009