[Keyword: Holes] AND [All Categories: Computer Science] : Search

System Upgrade on Tue, May 28th, 2024 at 2am (EDT)

Existing users will be able to log into the site and access content. However, E-commerce and registration of new users may not be available for up to 12 hours.
For online purchase, please visit us again. Contact us at customercare@wspc.com for any enquiries.

Advanced Search

SEARCH GUIDE

Bestsellers

Handbook of Machine Learning

Handbook of Machine Learning
Volume 1: Foundation of Artificial Intelligence
by Tshilidzi Marwala

Handbook on Computational Intelligence

Handbook on Computational Intelligence
In 2 Volumes
edited by Plamen Parvanov Angelov

Handbook of Pattern Recognition and Computer Vision

Handbook of Pattern Recognition and Computer Vision
5^th Edition
edited by C H Chen

Results: 1 - 1of1

Follow results:

per page:

Sort: Relevance

Context for search term 1Search term 1*

All Dates

LastSelect static range

Custom Range

Select starting monthSelect starting year

Select ending monthSelect ending year

Search name	Searched On	Run search
[Keyword: Holes] AND [All Categories: Computer Science] (1)	27 Mar 2025	Run
[Keyword: Yeast] AND [All Categories: Animal Physiology / Zoology] (2)	27 Mar 2025	Run
[Keyword: Flash] AND [All Categories: Nanotechnology & Nanoscience] (2)	27 Mar 2025	Run
[Keyword: Flash] AND [All Categories: Computer Systems] (1)	27 Mar 2025	Run
[Keyword: Crops] AND [All Categories: Environmental / Atmospheric Chemistry] (7)	27 Mar 2025	Run

articleNo Access
ORTHOGONAL EDGE VISIBILITY GRAPHS OF POLYGONS WITH HOLES
- G. SRINIVASARAGHAVAN and
- ASISH MUKHOPADHYAY
International Journal of Computational Geometry & Applications01 Feb 2000
Preview Abstract
In this paper we report on a set of six necessary conditions that must be satisfied by the edge visibility graph of an orthogonal polygon with holes. We have also proved the following significant result: If G is a connected, bipartite, planar, and irreducible (in a sense defined in the paper) graph then it can be realized (that is, there is a corresponding orthogonal polygon with holes) up to leaf addition.

1