Enumerating Collinear Points in Higher Dimensions

DOI10.7561/SACS.2019.1.81MaRDI QIDQ5089606zbMATH OpenOpenAlexFDO

Authors Ali Gholami Rudi, Raimi Ayinde Rufai

Publication date 19 July 2022

Published in Scientific Annals of Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.7561/sacs.2019.1.81

zbMATH Keywords

collinear pointsdegeneracy testingmaximal collinear subsets

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Nonnumerical algorithms (68W05) Analysis of algorithms (68W40)

Recommendations

• Enumerating extreme points in higher dimensions
• Enumerating extreme points in higher dimensions
• Collinear points in permutations
• Counting integer points in higher-dimensional polytopes
• Counting points of fixed degree and bounded height
• scientific article; zbMATH DE number 1555919
• Integer points enumerator of hypergraphic polytopes
• Enumerating projections of integer points in unbounded polyhedra
• Configurations of noncollinear points in the projective plane

Cited in

(1)

• Time and space efficient collinearity indexing

This page was built for publication: Enumerating Collinear Points in Higher Dimensions

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