Experience report: growing and shrinking polygons for random testing of computational geometry algorithms

DOI10.1145/2951913.2951927zbMATH Open1360.68879OpenAlexW2513776304MaRDI QIDQ2982014FDOQ2982014

Authors: Ilya Sergey 

Publication date: 10 May 2017

Published in: Proceedings of the 21st ACM SIGPLAN International Conference on Functional Programming (Search for Journal in Brave)

Full work available at URL: https://discovery.ucl.ac.uk/id/eprint/1545542/

Recommendations

• scientific article; zbMATH DE number 1670655
• Beginner's luck: a language for property-based generators
• Do judge a test by its cover. Combining combinatorial and property-based testing
• Convex-hull algorithms: implementation, testing, and experimentation
• Testing and tracing lazy functional programs using QuickCheck and Hat

zbMATH Keywords

computational geometryvisibilityart-gallery problemrandom testingQuickCheckScala

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Functional programming and lambda calculus (68N18)

Uses Software

• Scala

This page was built for publication: Experience report: growing and shrinking polygons for random testing of computational geometry algorithms

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