New algorithms for special cases of the hidden line elimination problem

No abstract is available for this paper.

• Publication year

  1985

• Venue

  Computer Vision Graphics and Image Processing

• Publication date

  1985-12-01

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1016/S0734-189X(87)80114-7
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Worst-case optimal hidden-surface removal

  1987cited by this paper
• Dynamic C-Oriented Polygonal Intersections Searching

  1986cited by this paper
• Quadratic bounds for hidden line elimination

  1986cited by this paper
• A worst-case efficient algorithm for hidden-line elimination †

  1985cited by this paper
• A fast line-sweep algorithm for hidden line elimination

  1985cited by this paper
• Interactive Computer Graphics

  1984cited by this paper
• Stabbing C-Oriented Polygons

  1983cited by this paper
• Plane-sweep algorithms for intersecting geometric figures

  1982cited by this paper
• Counting and Reporting Intersections of d-Ranges

  1982cited by this paper
• Polygonal Intersection Searching

  1982cited by this paper
• Rectilinear Line Segment Intersection, Layered Segment Trees, and Dynamization

  1982cited by this paper
• On the Intersection of Orthogonal Objects

  1981cited by this paper
• An Optimal Worst Case Algorithm for Reporting Intersections of Rectangles

  1980cited by this paper
• Algorithms for Reporting and Counting Geometric Intersections

  1979cited by this paper
• Geometric intersection problems

  1976cited by this paper
• A Characterization of Ten Hidden-Surface Algorithms

  1974cited by this paper

• A Space-Optimal Hidden Surface Removal Algorithm for Iso-Oriented Rectangles

  2020cites this paper
• An easier approach to visible edge determination from moving viewpoint

  2014cites this paper
• Minimum-link paths revisited

  2013cites this paper
• Faster Algorithms for Minimum-Link Paths with Restricted Orientations

  2011cites this paper
• A Space-Optimal Hidden Surface Removal Algorithm for Iso-Oriented Rectangles

  2011cites this paper
• Computing the visibility map of fat objects

  2007cites this paper
• Sweep Methods for Parallel Computational Geometry 1

  2005cites this paper
• Algorithms for Fat Objects: Decompositions and Applications

  2004cites this paper
• An optimal algorithm for reporting visible rectangles

  2002cites this paper
• An improved output-size sensitive parallel algorithm for hidden-surface removal for terrains

  2002cites this paper
• Partitioning Trimmed Spline Surfaces into NonSelf-Occluding Regions for Visibility Computation

  2000cites this paper
• Decomposing Spline Surfaces into Non-overlapping Regions for Visible Surface Computation

  1999cites this paper
• Efficient Algorithms for Computing a Complete Visibility Region in Three-Dimensional Space

  1998cites this paper
• An Efficient Output-Size Sensitive Parallel Algorithm for Hidden-Surface Removal for Terrains

  1998cites this paper
• Visibility Computation on Reconfigurable Meshes

  1997cites this paper
• Trends and Developments in Computational Geometry

  1997cites this paper
• Sweep methods for parallel computational geometry

  1996influential citation
• Space-Optimal Hidden Line Elimination for Rectangles

  1996cites this paper
• An efficient output-sensitive hidden-surface removal algorithm for polyhedral terrains

  1995cites this paper
• Visibility Computation on Recon gurable Meshes

  1995cites this paper
• Hidden Surface Removal Algorithms for Curved Surfaces

  1994cites this paper
• Visibility Algorithms on Triangulated Digital Terrain Models

  1994cites this paper
• Fat Triangles Determine Linearly Many Holes

  1994cites this paper
• An improved technique for output-sensitive hidden surface removal

  1994cites this paper
• Output-Sensitive Methods for Rectilinear Hidden Surface Removal

  1993cites this paper
• Generalized Hidden Surface Removal

  1993cites this paper
• Selected Topics from Computational Geometry, Data Structures and Motion Planning

  1992cites this paper
• A simple output-sensitive algorithm for hidden surface removal

  1992cites this paper
• Computing and verifying depth orders

  1992cites this paper
• Hidden Surface Removal for C-oriented Polyhedra

  1992influential citation
• Restricted Orientation Computational Geometry

  1992cites this paper
• Efficient Hidden Surface Removal for Objects with Small Union Size

  1992cites this paper
• A polygonal approach to hidden-line and hidden-surface elimination

  1992cites this paper
• Computing Minimum Length Paths of a Given Homotopy Class (Extended Abstract)

  1991cites this paper
• Efficient hidden surface removal for objects with small union size

  1991cites this paper
• The Intersection Searching Problem for c-Oriented Polygons

  1991cites this paper
• Generalized sweep methods for parallel computational geometry

  1990cites this paper
• Hidden Line Elimination for Isooriented Rectangels

  1990cites this paper
• Output-sensitive generation of the perspective view of isothetic parallelepipeds

  1990influential citation
• Hidden curve removal for free form surfaces

  1990cites this paper
• Optimal binary space partitions for orthogonal objects

  1990cites this paper
• An Input-Size/Output-Size Trade-Off in the Time-Complexity of Rectilinear Hidden Surface Removal (Preliminary Version)

  1990cites this paper
• Merging visibility maps

  1990cites this paper
• Hidden surface removal for axis-parallel polyhedra

  1990cites this paper
• Computation of the axial view of a set of isothetic parallelepipeds

  1990influential citation
• Advances in Computer Graphics V

  1989cites this paper
• Computational Geometry and its Application to Computer Graphics

  1989cites this paper
• Output-sensitive hidden surface removal

  1989cites this paper
• Output-Sensitive Hidden Surface Elimination for Rectangles

  1988cites this paper
• Visibility problems for orthogonal objects in two-or three-dimensions

  1988cites this paper
• Hidden surface removal for rectangles

  1988influential citation
• Hidden-surface removal in polyhedral cross-sections

  1988cites this paper
• An E cient Output-Sensitive Hidden-Surface Removal Algorithm for Polyhedral Terrains

  1988cites this paper
• Space-economical plane-sweep algorithms

  1986cites this paper
• A worst-case efficient algorithm for hidden-line elimination †

  1985cites this paper