Minimum-sum Dipolar Spanning Tree for Points in R3
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
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
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 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 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 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 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 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 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 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: accepted
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 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: accepted
Published:
This talk was given at SIGCSE 2020. It was a GitHub sponsored talk.
Published:
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 Devlopment (TDD) in a first course in data structures. Methods of teaching and utilization of the method are described, as are empirical results regarding student utilization of TDD and outcomes in the course. Instruction and project distribution that focuses on unit testing indicates an adoption of an incremental development methodology by the students in the study. Advantages, pitfalls and issues that need to be addressed in order to utilize the approach successfully in intermediate programming courses are discussed.
Published:
The talk was given as a part of our workshop supplements to assist students with fringe topics that when misunderstood have detrimental impacts on their ability to absorb primary course matter.
Graduate course, University of West Florida, Department of Computer Science, 2018
Advanced topics in database management systems will be covered, for example, further dependencies and higher normal forms, transaction processing, concurrency control, backup and recovery, indexing, replication, managing large databases, and contemporary issues and topics in databases.
Undergraduate course, University of West Florida, Department of Computer Science, 2020
Develop a software system for a real-world client while working in small teams. Develop and deliver relevant artifacts such as a project proposal, design, test plan, code, user’s manual, and project log with metrics as the software system evolves throughout the course. A final presentation and evaluation of the project experience will be prepared.
Undergraduate course, University of West Florida, Department of Computer Science, 2020
An intermediate course in object-oriented programming. Topics include object-oriented modeling, algorithms, inheritance, polymorphism, input/output. Emphasis will be on issues of object-oriented design and good programming practices. Students entering this course are expected to have a solid knowledge of programming in the object-oriented paradigm. The focus will be on developing skills in program design as a necessary prerequisite to effective implementation.
Graduate course, University of West Florida, Department of Computer Science, 2021
Capstone course for Masters students who do not elect the thesis option. Students will define and carry out a project that shows mastery of some topic in computing and produces some concrete product such as a report or a computer program.
Graduate course, University of West Florida, Department of Computer Science, 2021
A course in the Accelerated Software Engineering Foundations Series in which students will gain a comprehensive understanding of principles/concepts of Java programming and how to apply those principles/concepts in conjunction with principles of software engineering to design and develop object- oriented software systems. Students taking this course should have an understanding of programming language fundamentals including variables, constants, selection, iteration, arrays, and functions or methods.
Undergraduate course, University of West Florida, Department of Computer Science, 2022
A first course in Data Structures and Algorithms. Topics will include traditional data structures with a major focus on design and analysis of algorithms and will include projects that stress mathematics and science.
Graduate course, University of West Florida, Department of Computer Science, 2022
A comprehensive overview of the most commonly used approaches for approximate solution of NP-Hard problems, including linear programming, dynamic programming, and greedy algorithms. A survey of common algorithms including cache-aware algorithms, randomized algorithms, network flow algorithms, and online algorithms. This course takes an ‘experimental algorithms’ approach to educating students on augmenting theoretical results with empirical methods for the design of algorithms that are effective in practice.