Computing the minkowski sum of monotone polygons

IEICE Transactions on Information and Systems

Volumn E80-D, Issue 2, 1997, Pages 218-231

  Hernandez Barrera, Antonio ^a  

^a HIROSHIMA UNIVERSITY   (Japan)

Author keywords

Algorithms; Computational complexity; Computational geometry; Lower envelope; Minkowski sum; Monotone polygon

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTATIONAL GEOMETRY; COMPUTATIONAL METHODS;

MINKOWSKI SUM; MONOTONE POLYGONS;

ALGORITHMS;

EID: 0031072767     PISSN: 09168532     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (19)

1. M.J. Fischer and M.O. Rabin, "Super-exponential complexity of Presburger arithmetic," SIAM-AMS Proc., vol.7, pp.27-41, 1974.
2. D.C. Oppen, "A 222 upper bound on the complexity of Presburger arithmetic," J. Computer & System Sciences, no. 16, pp.322-332, 1978.
3. D.C. Cooper, "Theorem proving in arithmetic without multiplication," Machine Intelligence, no.7, pp.91-99, 1972.
4. T. Higashino, J. Kitamichi, and K. Taniguchi, "Presburger arithmetic and its application to program developments," Computer Software, vol.9, no.6, pp.31-39, June 1992.
5. J. Kitamichi, S. Morioka, T. Higashino, and K. Taniguchi, "Automatic correctness proof of the implementation of synchronous sequential circuits using an algebraic approach," Proc. 2nd International Conference on Theorem Provers in Circuit Design (TPCD'94) eds. T. Kröpf and R. Kumar, vol.901 of Lecture Notes in Computer Science, pp.165-184, Springer-Verlag, Berlin, 1995.
6. X.D. Li, T. Higashino, and K. Taniguchi, "An automatic derivation of test cases for LOTOS expressions with data parameters," IEICE Trans., voI.J75-B-I, no.l 1, pp.734-743, Nov. 1992.
7. S. Morioka, K. Okano, T. Higashino, and K. Taniguchi, "Hierarchical design of stock management program using relational algebra and its correctness proof," Trans. Information Processing Society of Japan, vol.36, no.5, pp. 10911103, May 1995.
8. M. Fürer, "The complexity of Presburger arithmetic with bounded quantifier alternation depth," Theoretical Computer Science, vol.18, pp.105-111, 1982.
9. B. Scarpellini, "Complexity of subcases of Presburger arithmetic," American Mathematical Society, vol.284, no.l, pp.203-281, July 1984.
10. K. Naoi and N. Takahashi, "Technique for reducing computation for detecting infeasible paths using Presburger arithmetic," IEICE Technical Report, SS95-19, July 1995.
11. J.C. King, "Symbolic execution and program testing," ACM Commun., vol.19, no.7, pp.385-394, July 1976.
12. L.A. Clarke, "A system to generate test data and symbolically execute programs," IEEE Trans. Software Eng., vol.SE-2, no.3, pp.215-222, Sept. 1976.
13. L.A. Clarke and D.J. Richardson, "Applications of symbolic evaluation," J. Systems and Software, vol.5, no.l, pp. 15-35, 1985.
14. K. Naoi and N. Takahashi, "Detection of unfeasible paths with a path dependence flow graph," Systems and Com-puters in Japan, vol.25, no.IO, pp.I-14, 1994.
15. A. Goldberg, T.C. Wane, and D. Zimmerman, "Application of feasible path analysis to program testing," Proc. 1994 International Symposium on Software Testing and Analysis (ISSTA), pp.80-94, Aug. 1994.
16. R. Jasper, M. Brennan, K. Williamson, B. Currier, and D. Zimmerman, "Test data generation and feasible path analysis," Proc. 1994 International Symposium on Software Testing and Analysis (ISSTA), pp.95-107, Aug. 1994.
17. H.W. Lenstra Jr., "Integer programming with a fixed number of variables," in Mathematics of Operations Research, vol.8, no.4, pp.538-548, Nov. 1983.
18. R. Kannan, "Improved algorithms for integer programming and related lattice problems," Proc. ACM Symposium on Theory of Computing (STOC), pp.193-206, 1983.
19. K.L. Clarkson, "Las Vegas algorithms for linear and integer programming when the dimension is small," J. ACM, vol.42, no.2, pp.488-499, March 1995.