scientific article; zbMATH DE number 17809

zbMATH Open0755.68068MaRDI QIDQ3975151FDOQ3975151

Authors: Sebastian Iwanowski 

Publication date: 26 June 1992

Title of this publication is not available (Why is that?)

Recommendations

• Testing approximate symmetry in the plane is NP-hard
• scientific article; zbMATH DE number 49040
• scientific article; zbMATH DE number 1500509
• The complexity of planarity testing
• Optimal algorithms for finding the symmetries of a planar point set
• Optimal algorithms for symmetry detection in two and three dimensions
• scientific article; zbMATH DE number 1759539
• Approximate symmetries of planar algebraic curves with inexact input
• An analysis of symmetry for plane curves and plane curve algorithms

zbMATH Keywords

NP-hardreductionsymmetry detectionPLANAR-3-SAT

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Discrete mathematics in relation to computer science (68R99)

Cited In (2)

• Testing approximate symmetry in the plane is NP-hard
• Title not available (Why is that?)

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3975151)