# Sitemap

A list of all the posts and pages found on the site. For you robots out there is an XML version available for digesting as well.

## Markdown

This is a page not in th emain menu

## Basic Vim Setup

Published:

Vim is by no means the only code editing tool out there…it’s just the best one :grin:. It is highly customizable, and if you choose it as your editor you will modify it over time to suit your needs. For beginners, a very simple setup can go a long way in helping to develop code.

## Debugging Segmentation Faults in C++

Published:

Segmentation faults in C++ are a sign that you are trying to do hard things. Congratulations! Now, let’s take a peek at how to start debugging.

## Simplifying Make

Published:

This is an attempt at simplifying make, I hope it can help anyone who struggling with the basics.

## Uninitialized variables in C++

Published:

C++ won’t always work the way you expect, and that is by design. It’s a remarkably rigid language and it requires that a programmer cross all of their f’s and dot all of their j’s.

## Common Constructor Mistakes in C++

Published:

It is very common to have some difficulty when constructing custom classes in C++. Below I’ll discuss what tend to be the two most common problems I see with student submissions. The first is local scope vs instance variables. The second is a lack of default constructors.

Published:

What follows is an example of an overloaded operator for a class named Foo.

## 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

## Finding segments and triangles spanned by points in R3

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

## Finding a Minimum-Sum Dipolar Spanning Tree in R3

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

## Finding segments and triangles spanned by points in R3

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

## Visiting a Sequence of Points with a Bevel-Tip Needle

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.

## Minimum Separating Circle for Bichromatic Points in the Plane

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

## Git and GitHub

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.

## teaching

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.

## Capstone Systems Project

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.

## Intermediate Computer Programming - Java

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.

## Data Structures and Algorithms I

Undergraduate course, University of West Florida, Department of Computer Science, 2020

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.

## Software Engineering Foundations - Java Programming

Graduate course, University of West Florida, Department of Computer Science, 2020

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.