NDLI: Piecewise-linear interpolation between polygonal slices

Please wait, while we are loading the content...

Vertical decompositions for triangles in 3-space

Almost tight upper bounds for the single cell and zone problems in three dimensions

On translational motion planning in 3-space

Motion planning amidst fat obstacles (extended abstract)

Approximate Euclidean shortest path in 3-space

The realization problem for Euclidean minimum spanning trees is NP-hard

Optimal parallel randomized algorithms for the Voronoi diagram of line segments in the plane and related problems

Constructing levels in arrangements and higher order Voronoi diagrams

Computing many faces in arrangements of lines and segments

Matching shapes with a reference point

Piecewise-linear interpolation between polygonal slices

Practical methods for approximate geometric pattern matching under rigid motions: (preliminary version)

Spheres, molecules, and hidden surface removal

Determining the castability of simple polyhedra

A fast algorithm for constructing sparse Euclidean spanners

Dynamic maintenance of maximas of 2-d point sets

Biased finger trees and three-dimensional layers of maxima: (preliminary version)

An algorithm for approximate closest-point queries

New techniques for exact and approximate dynamic closest-point problems

Competitive searching in a generalized street

The tight lower bound for the Steiner ratio in Minkowski planes

Bounding the number of geometric permutations induced by k-transversals

Applications of the crossing number

Cutting dense point sets in half

Fast greedy triangulation algorithms

Linear-size nonobtuse triangulation of polygons

Bounds on the size of tetrahedralizations

An optimal bound for conforming quality triangulations: (extended abstract)

On the maximum degree of minimum spanning trees

Optimal linear-time algorithm for the shortest illuminating line segment in a polygon

Morphing simple polygons

A new technique to compute polygonal schema for 2-manifolds with application to null-homotopy detection

Triangulating topological spaces

Almost optimal set covers in finite VC-dimension: (preliminary version)

An efficient algorithm for the Euclidean two-center problem

On geometric optimization with few violated constraints

Efficient piecewise-linear function approximation using the uniform metric: (preliminary version)

Applications of weighted Voronoi diagrams and randomization to variance-based k-clustering: (extended abstract)

Bounded boxes, Hausdorff distance, and a new proof of an interesting Helly-type theorem

Computing envelopes in four dimensions with applications

Query-sensitive ray shooting

Efficient algorithms for generalized intersection searching on non-iso-oriented objects

An O(nlogn) implementation of the Douglas-Peucker algorithm for line simplification

Computing the rectangle discrepancy

An animation of a fixed-radius all-nearest-neighbors algorithm

GASP: a system to facilitate animating geometric algorithms

Penumbral shadows

Exact collision detection for interactive environments (extended abstract)

Almost optimal polyhedral separators

Interactive visualization of weighted three-dimensional alpha hulls

Piecewise-linear interpolation between polygonal slices

Content Provider	ACM Digital Library
Author	Sharir, Micha Barequet, Gill
Abstract	In this paper we present a new technique for piecewise-linear surface reconstruction from a series of parallel polygonal cross-sections. This is an important problem in medical imaging, surface reconstruction from topographic data, and other applications. We reduce the problem, as in most previous works, to a series of problems of piecewise-linear interpolation between each pair of successive slices. Our algorithm uses a partial curve matching technique for matching parts of the contours, an optimal triangulation of 3-D polygons for resolving the unmatched parts, and a minimum spanning tree heuristic for interpolating between non simply connected regions. Unlike previous attempts at solving this problem, our algorithm seems to handle successfully any kind of data. It allows multiple contours in each slice, with any hierarchy of contour nesting, and avoids the introduction of counter-intuitive bridges between contours, proposed in some earlier papers to handle interpolation between multiply connected regions. Experimental results on various complex examples, involving actual medical imaging data, are presented, and show the good and robust performance of our algorithm.
Starting Page	93
Ending Page	102
Page Count	10
File Format	PDF
ISBN	0897916484
DOI	10.1145/177424.177562
Language	English
Publisher	Association for Computing Machinery (ACM)
Publisher Date	1994-06-10
Publisher Place	New York
Access Restriction	Subscribed
Subject Keyword	Surface reconstruction Triangulation Curve matching Polyhedra Geometric hashing Slice interpolation Surface fitting Tiling Branching surfaces Dynamic programming
Content Type	Text
Resource Type	Article

Central Library (ISO-9001:2015 Certified)
Indian Institute of Technology Kharagpur
Kharagpur, West Bengal, India | PIN - 721302

See location in the Map
03222 282435
Mail: support@ndl.gov.in

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in