Article

Free access

Testing the congruence of d-dimensional point sets

Authors:

Peter Braß,

Christian KnauerAuthors Info & Claims

SCG '00: Proceedings of the sixteenth annual symposium on Computational geometry

Pages 310 - 314

https://doi.org/10.1145/336154.336217

Published: 01 May 2000 Publication History

PDF eReader

References

[1]

T. Akutsu. On determining the congruence of point sets in d dimensions. Comput. Geom. Theory Appl., 9(4):247-256, 1998.

Digital Library

Google Scholar

[2]

H. Alt and L. Guibas. Resemblance of geometric objects. In J.-R. Sack and J. Urrutia, editors, Handbook of Computational Geometry, pages 121-153. Elsevier Science Publishers B.V. North-Holland, Amsterdam, 1999.

Google Scholar

[3]

H. Alt, K. Mehlhorn, H. Wagener, and E. Welzl. Congruence, similarity and symmetries of geometric objects. Discrete Comput. Geom., 3:237-256, 1988.

Digital Library

Google Scholar

[4]

M. J. Atallah. On symmetry detection. IEEE Trans. Comput., 34:663-666, 1985.

Digital Library

Google Scholar

[5]

M. D. Atkinson. An optimal algorithm for geometrical congruence. J. Algorithms, 8:159-172, 1987.

Digital Library

Google Scholar

[6]

H. P. Croft, K. J. Falconer, and R. K. Guy. Unsolved Problems in Geometry. Springer-Verlag, 1991.

Crossref

Google Scholar

[7]

B. Delone, N. Dolbilin, M. Stogrin, and R. Galiulin. A local criterion for regularity of a system of points. Soy. Math. Dokl, 17:319-322, 1976.

Google Scholar

[8]

N. Dolbilin, J. Lagarias, and M. Senechal. Multiregular point systems. Discrete Comput. Geom., 20:477-498, 1998.

Crossref

Google Scholar

[9]

B. Griinbaum and L. Kelly. Metrically homogeneous sets. Israel J. Math., 6:183-197, 1968. Corrigendum in Israel J. Math., 8:93-95, 1970.

Crossref

Google Scholar

[10]

P. T. Highnam. Optimal algorithms for finding the symmetries of a planar point set. Inform. Process. Left., 22:219-222, 1986.

Digital Library

Google Scholar

[11]

G. K. Manacher. An application of pattern matching to a problem in geometrical complexity. Inform. Process. Lett., 5:6-7, 1976.

Crossref

Google Scholar

[12]

C. Shannon. Probability of error for optimal codes in a gaussian channel. Bell System Tech. J., 38:611-656, 1959.

Crossref

Google Scholar

[13]

K. Sugihara. An n log n algorithm for determining the congruity of polyhedra. J. Comput. Syst. Sci., 29:36-47, 1984.

Crossref

Google Scholar

[14]

A. D. Wyner. Capabilities of bounded discrepancy decoding. ATeJT Tech. J., 44:1061-1122, 1965.

Google Scholar

Cited By

View all

Kumar R(2018)A Review of Non-Minutiae Based Fingerprint FeaturesInternational Journal of Computer Vision and Image Processing10.4018/IJCVIP.20180101038:1(32-58)Online publication date: 1-Jan-2018
https://dl.acm.org/doi/10.4018/IJCVIP.2018010103
Arvind VRattan G(2014)The Parameterized Complexity of Geometric Graph IsomorphismParameterized and Exact Computation10.1007/978-3-319-13524-3_5(51-62)Online publication date: 3-Dec-2014
https://doi.org/10.1007/978-3-319-13524-3_5
Manjunath MSharma V(2011)Applications of dimensionality reduction and exponential sums to graph automorphismTheoretical Computer Science10.1016/j.tcs.2011.03.014412:29(3639-3649)Online publication date: 1-Jul-2011
https://dl.acm.org/doi/10.1016/j.tcs.2011.03.014
Show More Cited By

Index Terms

Testing the congruence of d-dimensional point sets

Recommendations

Factor Congruence Lifting Property

In previous work, we have introduced and studied a lifting property in congruence---distributive universal algebras which we have defined based on the Boolean congruences of such algebras, and which we have called the Congruence Boolean Lifting ...
Congruence kernels of orthomodular implication algebras

Abstracting from certain properties of the implication operation in Boolean algebras leads to so-called orthomodular implication algebras. These are in a natural one-to-one correspondence with families of orthomodular lattices. It is proved that ...
On derivations and their fixed point sets in residuated lattices

The main goal of this paper is to investigate derivations in residuated lattices and characterize some special types of residuated lattices in terms of derivations. In the paper, we discuss related properties of some particular derivations and give some ...

Comments

Information & Contributors

Information

Published In

SCG '00: Proceedings of the sixteenth annual symposium on Computational geometry

May 2000

379 pages

ISBN:1581132247

DOI:10.1145/336154

Chairmen:
Siu-Wing Cheng
HKUST, Hong Kong
,
Otfried Cheong
HKUST, Hong Kong
,
Pankaj Agarwal
Duke Univ., Durham, N.C
,
Steven Fortune
Bell Labs

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 May 2000

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

SoCG00

Sponsor:

SoCG00: The 16th Annual ACM Symposium on Computational Geometry

June 12 - 14, 2000

Kowloon, Clear Water Bay, Hong Kong

Acceptance Rates

SCG '00 Paper Acceptance Rate 41 of 123 submissions, 33%;

Overall Acceptance Rate 625 of 1,685 submissions, 37%

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

7
Total Citations
View Citations
336
Total Downloads

Downloads (Last 12 months)22
Downloads (Last 6 weeks)4

Reflects downloads up to 10 Aug 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Kumar R(2018)A Review of Non-Minutiae Based Fingerprint FeaturesInternational Journal of Computer Vision and Image Processing10.4018/IJCVIP.20180101038:1(32-58)Online publication date: 1-Jan-2018
https://dl.acm.org/doi/10.4018/IJCVIP.2018010103
Arvind VRattan G(2014)The Parameterized Complexity of Geometric Graph IsomorphismParameterized and Exact Computation10.1007/978-3-319-13524-3_5(51-62)Online publication date: 3-Dec-2014
https://doi.org/10.1007/978-3-319-13524-3_5
Manjunath MSharma V(2011)Applications of dimensionality reduction and exponential sums to graph automorphismTheoretical Computer Science10.1016/j.tcs.2011.03.014412:29(3639-3649)Online publication date: 1-Jul-2011
https://dl.acm.org/doi/10.1016/j.tcs.2011.03.014
Agarwal PApfelbaum RPurdy GSharir MErickson J(2007)Similar simplices in a d-dimensional point setProceedings of the twenty-third annual symposium on Computational geometry10.1145/1247069.1247112(232-238)Online publication date: 6-Jun-2007
https://dl.acm.org/doi/10.1145/1247069.1247112
Brass P(2003)On finding maximum-cardinality symmetric subsetsComputational Geometry: Theory and Applications10.1016/S0925-7721(02)00046-924:1(19-25)Online publication date: 1-Jan-2003
https://dl.acm.org/doi/10.1016/S0925-7721%2802%2900046-9
Veltkamp RHagedoorn M(2001)State of the Art in Shape MatchingPrinciples of Visual Information Retrieval10.1007/978-1-4471-3702-3_4(87-119)Online publication date: 2001
https://doi.org/10.1007/978-1-4471-3702-3_4
Brass P(2001)On Finding Maximum-Cardinality Symmetric SubsetsDiscrete and Computational Geometry10.1007/3-540-47738-1_8(106-112)Online publication date: 20-Sep-2001
https://doi.org/10.1007/3-540-47738-1_8

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Index Terms

Recommendations

Factor Congruence Lifting Property

Congruence kernels of orthomodular implication algebras

On derivations and their fixed point sets in residuated lattices