Judging the Intersection of Convex Polygons by Bracket Method

DOI

10.2991/iccasm.2012.335How to use a DOI?

Keywords

Bracket, Computer graphics, Convex polygons Intersection

Abstract

In this paper, we study a basic problem based on bracket manipulations in computational geometry: how to judge if two solid convex polygons intersect or not. A key idea in our criteria is that the signs of some brackets of the homogeneous coordinates of the vertices of the two convex bodies are all we need in carrying out the judgment. Experiments show that the uniformity of representation by bracket is significant and efficient in practical computation.

Copyright

© 2012, the Authors. Published by Atlantis Press.

Open Access

This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).

Download article (PDF)

TY  - CONF
AU  - Ying Chen
AU  - Yaogang Du
PY  - 2012/08
DA  - 2012/08
TI  - Judging the Intersection of Convex Polygons by Bracket Method
BT  - Proceedings of the 2012 International Conference on Computer Application and System Modeling (ICCASM 2012)
PB  - Atlantis Press
SP  - 1312
EP  - 1314
SN  - 1951-6851
UR  - https://doi.org/10.2991/iccasm.2012.335
DO  - 10.2991/iccasm.2012.335
ID  - Chen2012/08
ER  -