Skip to main content

and
  1. No Access

    Chapter and Conference Paper

    Robust Nonparametric Data Approximation of Point Sets via Data Reduction

    In this paper we present a novel nonparametric method for simplifying piecewise linear curves and we apply this method as a statistical approximation of structure within sequential data in the plane. We consid...

    Stephane Durocher, Alexandre Leblanc, Jason Morrison in Algorithms and Computation (2012)

  2. No Access

    Chapter and Conference Paper

    In-Place Planar Convex Hull Algorithms

    An in-place algorithm is one in which the output is given in the same location as the input and only a small amount of additional memory is used by the algorithm. In this paper we describe three in-place algor...

    Hervé Brönnimann, John Iacono, Jyrki Katajainen in LATIN 2002: Theoretical Informatics (2002)

  3. No Access

    Chapter and Conference Paper

    The Grid Placement Problem

    We consider the problem of placing a regular grid over a set of points in order to minimize (or maximize) the number of grid cells not containing any points. We give an O(nlog n) time and O(n) space algorithm for...

    Prosenjit Bose, Anil Maheshwari, Pat Morin in Algorithms and Data Structures (2001)