Testing orthogonal shapes

Kathleen Romanik, Steven L Salzberg

Research output: Contribution to journalArticle

Abstract

A testing algorithm takes a model and produces a set of points that can be used to test whether or not an unknown object is sufficiently similar to the model. A testing algorithm performs a complementary task to that performed by a learning algorithm, which takes a set of examples and builds a model that succinctly describes them. Testing can also be viewed as a type of geometric probing that uses point probes (i.e. test points) to verify that an unknown geometric object is similar to a given model. In this paper we examine the problem of verifying orthogonal shapes using test points. In particular, we give testing algorithms for sets of disjoint rectangles in two and higher dimensions and for general orthogonal shapes in 2-D and 3-D. This work is a first step towards developing efficient testing algorithms for objects with more general shapes, including those with non-orthogonal and curved surfaces.

Original languageEnglish (US)
Pages (from-to)33-49
Number of pages17
JournalComputational Geometry: Theory and Applications
Volume5
Issue number1
DOIs
StatePublished - 1995

Fingerprint

Testing
Unknown
Geometric object
Curved Surface
Model
Rectangle
Set of points
Learning algorithms
Higher Dimensions
Learning Algorithm
Two Dimensions
Disjoint
Probe
Verify
Object

Keywords

  • Helpful teacher learning
  • Probing
  • Testing

ASJC Scopus subject areas

  • Computational Theory and Mathematics
  • Computer Science Applications
  • Computational Mathematics
  • Control and Optimization
  • Geometry and Topology

Cite this

Testing orthogonal shapes. / Romanik, Kathleen; Salzberg, Steven L.

In: Computational Geometry: Theory and Applications, Vol. 5, No. 1, 1995, p. 33-49.

Research output: Contribution to journalArticle

@article{2d795975aae0428680aa5458996847ee,
title = "Testing orthogonal shapes",
abstract = "A testing algorithm takes a model and produces a set of points that can be used to test whether or not an unknown object is sufficiently similar to the model. A testing algorithm performs a complementary task to that performed by a learning algorithm, which takes a set of examples and builds a model that succinctly describes them. Testing can also be viewed as a type of geometric probing that uses point probes (i.e. test points) to verify that an unknown geometric object is similar to a given model. In this paper we examine the problem of verifying orthogonal shapes using test points. In particular, we give testing algorithms for sets of disjoint rectangles in two and higher dimensions and for general orthogonal shapes in 2-D and 3-D. This work is a first step towards developing efficient testing algorithms for objects with more general shapes, including those with non-orthogonal and curved surfaces.",
keywords = "Helpful teacher learning, Probing, Testing",
author = "Kathleen Romanik and Salzberg, {Steven L}",
year = "1995",
doi = "10.1016/0925-7721(94)00016-O",
language = "English (US)",
volume = "5",
pages = "33--49",
journal = "Computational Geometry: Theory and Applications",
issn = "0925-7721",
publisher = "Elsevier",
number = "1",

}

TY - JOUR

T1 - Testing orthogonal shapes

AU - Romanik, Kathleen

AU - Salzberg, Steven L

PY - 1995

Y1 - 1995

N2 - A testing algorithm takes a model and produces a set of points that can be used to test whether or not an unknown object is sufficiently similar to the model. A testing algorithm performs a complementary task to that performed by a learning algorithm, which takes a set of examples and builds a model that succinctly describes them. Testing can also be viewed as a type of geometric probing that uses point probes (i.e. test points) to verify that an unknown geometric object is similar to a given model. In this paper we examine the problem of verifying orthogonal shapes using test points. In particular, we give testing algorithms for sets of disjoint rectangles in two and higher dimensions and for general orthogonal shapes in 2-D and 3-D. This work is a first step towards developing efficient testing algorithms for objects with more general shapes, including those with non-orthogonal and curved surfaces.

AB - A testing algorithm takes a model and produces a set of points that can be used to test whether or not an unknown object is sufficiently similar to the model. A testing algorithm performs a complementary task to that performed by a learning algorithm, which takes a set of examples and builds a model that succinctly describes them. Testing can also be viewed as a type of geometric probing that uses point probes (i.e. test points) to verify that an unknown geometric object is similar to a given model. In this paper we examine the problem of verifying orthogonal shapes using test points. In particular, we give testing algorithms for sets of disjoint rectangles in two and higher dimensions and for general orthogonal shapes in 2-D and 3-D. This work is a first step towards developing efficient testing algorithms for objects with more general shapes, including those with non-orthogonal and curved surfaces.

KW - Helpful teacher learning

KW - Probing

KW - Testing

UR - http://www.scopus.com/inward/record.url?scp=0347671431&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0347671431&partnerID=8YFLogxK

U2 - 10.1016/0925-7721(94)00016-O

DO - 10.1016/0925-7721(94)00016-O

M3 - Article

AN - SCOPUS:0347671431

VL - 5

SP - 33

EP - 49

JO - Computational Geometry: Theory and Applications

JF - Computational Geometry: Theory and Applications

SN - 0925-7721

IS - 1

ER -