Testing a binary space partitioning algorithm with metamorphic testing

Authors:
Fei-Ching Kuo;Shuang Liu;T. Y. Chen
Affiliations:
Swinburne University of Technology, Hawthorn, Australia;Swinburne University of Technology, Hawthorn, Australia;Swinburne University of Technology, Hawthorn, Australia
Venue:
Proceedings of the 2011 ACM Symposium on Applied Computing
Year:
2011

Citing 10
Cited 0

Merging BSP trees yields polyhedral set operations

SIGGRAPH '90 Proceedings of the 17th annual conference on Computer graphics and interactive techniques
Ray tracing with the BSP tree

Graphics Gems III
On visible surface generation by a priori tree structures

SIGGRAPH '80 Proceedings of the 7th annual conference on Computer graphics and interactive techniques
Automated Metamorphic Testing

COMPSAC '03 Proceedings of the 27th Annual International Conference on Computer Software and Applications
Binary Space Partitions for Axis-Parallel Segments, Rectangles, and Hyperrectangles

Discrete & Computational Geometry
Hints on Test Data Selection: Help for the Practicing Programmer

Computer
Using JML Runtime Assertion Checking to Automate Metamorphic Testing in Applications without Test Oracles

ICST '09 Proceedings of the 2009 International Conference on Software Testing Verification and Validation
Automatic system testing of programs without test oracles

Proceedings of the eighteenth international symposium on Software testing and analysis
Automated Test Data Generation on the Analyses of Feature Models: A Metamorphic Testing Approach

ICST '10 Proceedings of the 2010 Third International Conference on Software Testing, Verification and Validation
Automated functional testing of online search services

Software Testing, Verification & Reliability

Quantified Score

Hi-index	0.00

Visualization

Abstract

Surface visibility problem is a well known problem in computer graphics. The problem is to decide the visibility of an object surface to a viewer in a space. Binary Space Partitioning tree (BSP tree) has been proposed to enable efficient determination of surface visibility. The BSP tree has also been used to solve many problems, such as collision detection, ray tracing and solid modelling. As a consequence of the extensive applications of the BSP tree, it is important to ensure the correctness of its implementation. In this paper, we report our experience of testing software that deals with the surface visibility using the BSP tree. We demonstrate how we analysed the software behaviour, selected test cases to reveal a real-life software failure, and debugged the program to fix the fault. This study provides insight into testing of other BSP-tree related algorithms.