6533b7d3fe1ef96bd12607d5
RESEARCH PRODUCT
INCIDENCE CONSTRAINTS: A COMBINATORIAL APPROACH
Pascal SchreckDominique Micheluccisubject
Discrete mathematicsIncidence geometryApplied MathematicsCombinatorial proofSymbolic computationTheoretical Computer ScienceAlgebraComputational MathematicsComputational Theory and MathematicsGeometry and TopologyProjective planeAlgebraic numberIncidence (geometry)MathematicsProjective geometrydescription
The simplest geometric constraints are incidences between points and lines in the projective plane. This problem is universal, in the sense that all algebraic systems reduce to such geometric constraints. Detecting incidence dependences between these geometric constraints is NP-complete. New methods to prove incidence theorems are proposed, which use strictly no computer algebra but only combinatorial arguments.
| year | journal | country | edition | language |
|---|---|---|---|---|
| 2006-12-01 | International Journal of Computational Geometry & Applications |