Skip Nav Destination
Close Modal
Update search
Filter
- Title
- Author
- Author Affiliations
- Full Text
- Abstract
- Keyword
- DOI
- ISBN
- ISBN-10
- ISSN
- EISSN
- Issue
- Journal Volume Number
- References
- Conference Volume Title
- Paper No
Filter
- Title
- Author
- Author Affiliations
- Full Text
- Abstract
- Keyword
- DOI
- ISBN
- ISBN-10
- ISSN
- EISSN
- Issue
- Journal Volume Number
- References
- Conference Volume Title
- Paper No
Filter
- Title
- Author
- Author Affiliations
- Full Text
- Abstract
- Keyword
- DOI
- ISBN
- ISBN-10
- ISSN
- EISSN
- Issue
- Journal Volume Number
- References
- Conference Volume Title
- Paper No
Filter
- Title
- Author
- Author Affiliations
- Full Text
- Abstract
- Keyword
- DOI
- ISBN
- ISBN-10
- ISSN
- EISSN
- Issue
- Journal Volume Number
- References
- Conference Volume Title
- Paper No
Filter
- Title
- Author
- Author Affiliations
- Full Text
- Abstract
- Keyword
- DOI
- ISBN
- ISBN-10
- ISSN
- EISSN
- Issue
- Journal Volume Number
- References
- Conference Volume Title
- Paper No
Filter
- Title
- Author
- Author Affiliations
- Full Text
- Abstract
- Keyword
- DOI
- ISBN
- ISBN-10
- ISSN
- EISSN
- Issue
- Journal Volume Number
- References
- Conference Volume Title
- Paper No
NARROW
Format
Article Type
Subject Area
Topics
Date
Availability
1-2 of 2
Keywords: linear programming
Close
Follow your search
Access your saved searches in your account
Would you like to receive an alert when new items match your search?
Sort by
Journal Articles
Publisher: ASME
Article Type: Article
J. Comput. Inf. Sci. Eng. March 2005, 5(1): 48–55.
Published Online: March 14, 2005
... collision detection problem between convex objects as a linear program. One of the strengths of the proposed methodology is its capability of addressing high speed interframe collision. In addition to the interframe collision detection, experimental data demonstrate that mathematical programming approaches...
Journal Articles
Publisher: ASME
Article Type: Technical Papers
J. Comput. Inf. Sci. Eng. June 2002, 2(2): 86–97.
Published Online: September 25, 2002
... partitions of faces into regions are explored until the smallest number of regions is found. During this process, a linear programming problem is adopted for finding a satisfactory parting direction of a region. Algorithms are presented for the region generating and combining process. Our approach...