Conference ProceedingsOPEN ACCESS

Algorithm for finding the domain intersection of a set of polytopes

Procedia Computer Science (2013) 18 459-464
DOI: 10.1016/j.procs.2013.05.209
8Citations
Citations of this article
9Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

The modified version of GJK algorithm for finding a common point of two polytopes is considered. Knowing this point and using the duality theorem the intersection of two polytopes can be found. Considering polytopes in pairs, we can find an intersection region of m polytopes. © 2013 The Authors. Published by Elsevier B.V.

Author supplied keywords

Cite

CITATION STYLE

APA

Tereshchenko, V., Chevokin, S., & Fisunenko, A. (2013). Algorithm for finding the domain intersection of a set of polytopes. In Procedia Computer Science (Vol. 18, pp. 459–464). Elsevier B.V. https://doi.org/10.1016/j.procs.2013.05.209

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free