NDLI: Polygon visibility ordering via Voronoi diagrams

Content Provider	Springer Nature Link
Author	Fukushige, Shinichi Suzuki, Hiromasa
Copyright Year	2007
Abstract	Visibility determination is one of the oldest problems in computer graphics. The visibility, in terms of back-to-front polygon visibility ordering, is determined by updating a priority list as the viewpoint moves. A new list-priority algorithm, utilizing a property of Voronoi diagrams, is proposed in this paper. The operation is in two phases. First, in a pre-processing phase the scene is divided into Voronoi cells. A sub-list associated with each cell contains references to those polygons that intersect with it. The polygons are assigned a fixed set of view-independent priority orders within the cluster. Last, an interactive phase sorts the clusters according to the depth value of each Voronoi site. The most time-consuming work is performed during the pre-processing phase that only has to be executed once for the scene. Since all the polygons in a cell are pre-computed to obtain the fixed priority order within the cluster, a relatively simple task is left in the interactive phase, which is only to sort the clusters repeatedly when the viewpoint is changed. This method contains performance benefits that make it better shaped than previous BSP based methods.
Starting Page	503
Ending Page	511
Page Count	9
File Format	PDF
ISSN	01782789
Journal	The Visual Computer
Volume Number	23
Issue Number	7
e-ISSN	14322315
Language	English
Publisher	Springer-Verlag
Publisher Date	2007-05-24
Publisher Place	Berlin, Heidelberg
Access Restriction	One Nation One Subscription (ONOS)
Subject Keyword	Visibility determination Voronoi diagrams Space subdivision Visibility ordering Priority algorithm Image Processing and Computer Vision Artificial Intelligence (incl. Robotics) Computer Graphics
Content Type	Text
Resource Type	Article
Subject	Computer Graphics and Computer-Aided Design Computer Vision and Pattern Recognition Software

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

Improved perspective visibility ordering for object-order volume rendering

Subdivision depth computation for n-ary subdivision curves/surfaces

Exact, robust and efficient full visibility computation in Plücker space

Good-visibility maps visualization

An intuitive polygon morphing

Dynamic Voronoi diagram of complex sites

An iterative/subdivision hybrid algorithm for curve/curve intersection

Similarity based interpolation using Catmull–Clark subdivision surfaces

Detecting and reconstructing subdivision connectivity

Polygon visibility ordering via Voronoi diagrams

Similar Documents

Improved perspective visibility ordering for object-order volume rendering

Subdivision depth computation for n-ary subdivision curves/surfaces

Exact, robust and efficient full visibility computation in Plücker space

Good-visibility maps visualization

An intuitive polygon morphing

Dynamic Voronoi diagram of complex sites

An iterative/subdivision hybrid algorithm for curve/curve intersection

Similarity based interpolation using Catmull–Clark subdivision surfaces

Detecting and reconstructing subdivision connectivity

Polygon visibility ordering via Voronoi diagrams