SCOPUS 정보 검색 플랫폼

CCCG 2007 - 19th Canadian Conference on Computational Geometry

Volumn , Issue , 2007, Pages 181-184

Exact and approximate geometric pattern matching for point sets in the plane under similarity transformations

(2) Aiger, Dror a,b Kedem, Klara a

a BEN GURION UNIVERSITY OF THE NEGEV (Israel)

b ORBOTECH LTD (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATE ALGORITHMS; APPROXIMATE SOLUTION; GEOMETRIC PATTERN MATCHING; HAUSDORFF DISTANCE; HIGH PROBABILITY; POINT SET; RUNTIMES; SIMILARITY TRANSFORMATION;

COMPUTATIONAL GEOMETRY;

EID: 84889707143 PISSN: None EISSN: None Source Type: Conference Proceeding
DOI: None Document Type: Conference Paper

Times cited : (7)

References (9)

1
- 20744455809
- On approximating the depth and related problems
- Vancouver, British Columbia, January 23-25
- B. Aronov, S. Har-Peled, "On approximating the depth and related problems", In Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms (Vancouver, British Columbia, January 23-25, 2005).
- (2005) Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms
- Aronov, B.¹ Har-Peled, S.²

2
- 0032317816
- Pattern matching for spatial point sets
- D. E. Cardoze, L. J. Schulman, "Pattern Matching for Spatial Point Sets", FOCS 1998: 156-165
- (1998) FOCS , pp. 156-165
- Cardoze, D.E.¹ Schulman, L.J.²

3
- 0040633364
- Getting around a lower bound for the minimum hausdorff distance
- L. P. Chew, K. Kedem, "Getting around a lower bound for the minimum Hausdorff distance", Comput. Geom. 10(3): 197-202 (1998).
- (1998) Comput. Geom. , vol.10 , Issue.3 , pp. 197-202
- Chew, L.P.¹ Kedem, K.²

4
- 0001532918
- Geometric pattern matching under euclidean motion
- P. Chew, M. Goodrich, D. Huttenlocher, K. Kedem, J. Kleinberg, D. Kravets, "Geometric Pattern Matching under Euclidean motion", Computational Geometry: Theory and applications, 7:113-124, 1997.
- (1997) Computational Geometry: Theory and Applications , vol.7 , pp. 113-124
- Chew, P.¹ Goodrich, M.² Huttenlocher, D.³ Kedem, K.⁴ Kleinberg, J.⁵ Kravets, D.⁶

5
- 21144432140
- Combinatorial and experimental methods for approximate point pattern matching
- M. Gavrilov, P. Indyk, R. Motwani, S. Venkatasubramanian, "Combinatorial and Experimental Methods for Approximate Point Pattern Matching", Algorithmica 38(1): 59-90 (2003)
- (2003) Algorithmica , vol.38 , Issue.1 , pp. 59-90
- Gavrilov, M.¹ Indyk, P.² Motwani, R.³ Venkatasubramanian, S.⁴

6
- 0032634603
- Approximate geometric pattern matching using rigid motions
- M. T. Goodrich, J. S. B. Mitchell, M. W. Orletsky, "Approximate Geometric Pattern Matching Using Rigid Motions", IEEE trans. Pattern Anal. Match. Intell. 21(4):371-379(1999).
- (1999) IEEE Trans. Pattern Anal. Match. Intell. , vol.21 , Issue.4 , pp. 371-379
- Goodrich, M.T.¹ Mitchell, J.S.B.² Orletsky, M.W.³

7
- 0006106313
- Approximate decision algorithms for point set congruence
- P. J. Heffernan, S. Schirra, "Approximate Decision Algorithms for Point Set Congruence", Comput. Geom. 4: 137-156 (1994).
- (1994) Comput. Geom. , vol.4 , pp. 137-156
- Heffernan, P.J.¹ Schirra, S.²

8
- 21144462806
- Efficient partition trees
- J. Matousek, "Efficient Partition Trees". Discrete and Computational Geometry 8: 315-334 (1992)
- (1992) Discrete and Computational Geometry , vol.8 , pp. 315-334
- Matousek, J.¹

9
- 0020845843
- Linear programming in linear time when the dimension is fixed
- N. Megiddo, "Linear Programming in Linear Time When the Dimension Is Fixed". J. ACM 31(1): 114-127 (1984).
- (1984) J. ACM , vol.31 , Issue.1 , pp. 114-127
- Megiddo, N.¹

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