메뉴 건너뛰기




Volumn E83-A, Issue 4, 2000, Pages 722-730

A parallel algorithm for constructing strongly convex superhulls of points

Author keywords

Computational geometry; Convexity; Divide and conquer; Parallel algorithm; Strongly convex superhull

Indexed keywords

STRONGLY CONVEX SUPERHULLS;

EID: 0033702572     PISSN: 09168508     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article
Times cited : (3)

References (12)
  • 2
    • 38249040380 scopus 로고
    • Efficient parallel solutions to some geometric problems
    • M.J. Atallah and M.T. Goodrich, "Efficient parallel solutions to some geometric problems," Parallel and Distributed Computing, vol.3, pp.492-507, 1986.
    • (1986) Parallel and Distributed Computing , vol.3 , pp. 492-507
    • Atallah, M.J.1    Goodrich, M.T.2
  • 3
    • 0023833316 scopus 로고
    • Parallel algorithms for some functions of two convex polygons
    • M.J. Atallah and M.T. Goodrich, "Parallel algorithms for some functions of two convex polygons," Algorithmica, vol.3, pp.535-548, 1988.
    • (1988) Algorithmica , vol.3 , pp. 535-548
    • Atallah, M.J.1    Goodrich, M.T.2
  • 4
    • 0028532217 scopus 로고
    • A parallel method for the prefix convex hulls problem
    • Oct.
    • W. Chen, K. Nakano, T. Masuzawa, and N. Tokura, "A parallel method for the prefix convex hulls problem," IEICE Trans. Fundamentals, vol.E77-A, no.10, pp.1675-1683, Oct. 1994.
    • (1994) IEICE Trans. Fundamentals , vol.E77-A , Issue.10 , pp. 1675-1683
    • Chen, W.1    Nakano, K.2    Masuzawa, T.3    Tokura, N.4
  • 7
    • 52449145950 scopus 로고
    • Optimal parallel algorithms for point-set polygon problems
    • R. Cole and M.T. Goodrich, "Optimal parallel algorithms for point-set polygon problems," Algorithmica, vol.7, pp.3-23, 1992.
    • (1992) Algorithmica , vol.7 , pp. 3-23
    • Cole, R.1    Goodrich, M.T.2
  • 9
    • 0027606684 scopus 로고
    • Constructing strongly convex approximate hulls with inaccurate primitives
    • L. Guibas, D. Salesin, and J. Stolfi, "Constructing strongly convex approximate hulls with inaccurate primitives," Algorithmica, vol.9, pp.534-560, 1993.
    • (1993) Algorithmica , vol.9 , pp. 534-560
    • Guibas, L.1    Salesin, D.2    Stolfi, J.3
  • 10
    • 0021626446 scopus 로고
    • Computational geometry a survey
    • D.T. Lee and F.P. Preparata, "Computational geometry A survey," IEEE Trans. Comput., vol.C-33, no.12, pp.1072-1101, 1984.
    • (1984) IEEE Trans. Comput. , vol.C-33 , Issue.12 , pp. 1072-1101
    • Lee, D.T.1    Preparata, F.P.2
  • 11
    • 0010600355 scopus 로고
    • Constructing strongly convex hulls using exact or rounded arithmetic
    • Z. Li and V.J. Milenkovic, "Constructing strongly convex hulls using exact or rounded arithmetic," Algorithmica, vol.8, pp.345-364, 1992.
    • (1992) Algorithmica , vol.8 , pp. 345-364
    • Li, Z.1    Milenkovic, V.J.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.