Published in CSCI 2022, 2022
This work extends a prior study of a modified test-driven development approach to software development in a first course in data structures. The current aims to determine if students persisted in utilizing a test-driven development approach in a follow-on course in advanced data structures and algorithm analysis.
Recommended citation: https://ieeexplore.ieee.org/document/10216490/
Published in Lecture Notes in Networks and Systems, 2022
This study covers one of the more controversial aspects of the pandemic in the United States, that is mask wearing.
Recommended citation: https://doi.org/10.1007/978-3-030-98012-2_21
Published in FECS 2021, 2021
High failure rates in Data Structures and Algorithms courses suggest the need for different approaches to teaching programming. This work contains a description of an effort to introduce Test-Driven Development in a first course in data structures.
Recommended citation: https://www.researchgate.net/publication/364622224_CSCI_2021_BOOK_of_ABSTRACTS
Published in SIGCSE 2021, 2021
The Nifty Assignments special session is about promoting and sharing the ideas and ready-to-use materials of successful assignments
Recommended citation: Nick Parlante, Julie Zelenski, Adrian A. de Freitas, Troy B. Weingart, Keith Schwarz, Ben Stephenson, Steven Bitner: Nifty Assignments. SIGCSE 2021: 1240-1241 https://dl.acm.org/doi/10.1145/3408877.3439501
Published in Computational Geometry, 2012
We disuss the problem of finding the minimum-sum dipolar spanning tree (MSST) in three dimensions.
Recommended citation: https://www.sciencedirect.com/science/article/pii/S0925772112000314?via%3Dihub
Published in ISVD 2010, 2010
Consider two point sets in the plane, a red set of size n, and a blue set of size m. In this paper we show how to find the minimum separating circle, which is the smallest circle that contains all points of the red set and as few points as possible of the blue set in its interior
Recommended citation: https://ieeexplore.ieee.org/document/5521409
Published in LATIN 2010, 2010
Our main result is an algorithm to steer a bevel-tip needle through a sequence of treatment points in the plane while minimizing the number of times that the needle must be reoriented.
Recommended citation: https://link.springer.com/chapter/10.1007%2F978-3-642-12200-2_43
Published in Information Processing Letters, 2009
Given a set S of n points in R3 we consider finding the farthest line segment spanned by S from a query point q given as part of the input, and finding the minimum and maximum area triangles spanned by S.
Recommended citation: https://www.sciencedirect.com/science/article/pii/S0020019009002361
Published in HICSS 2008, 2008
We disuss the problem of finding the minimum-sum dipolar spanning tree (MSST) in R3.
Recommended citation: https://ieeexplore.ieee.org/document/4439175
Published in CCCG 2007, 2007
Given a set S of n points in R3 we consider finding the farthest line segment spanned by S from a query point q given as part of the input, and finding the minimum and maximum area triangles spanned by S.
Recommended citation: http://cccg.ca/proceedings/2007/01a3.pdf
Published in CCCG 2007, 2007
We disuss the problem of finding the minimum-sum dipolar spanning tree (MSST) in three dimensions.
Recommended citation: http://cccg.ca/proceedings/2007/04a1.pdf