Matches in SemOpenAlex for { <https://semopenalex.org/work/W31428279> ?p ?o ?g. }
Showing items 1 to 81 of
81
with 100 items per page.
- W31428279 abstract "We present solutions to three types of geometric problems in the thesis. The first two essentially deal with the visibility inside simple polygons. Two points in a simple polygon $P$ are said to be visible from each other if the line segment that connects them nowhere intersects the exterior of $P$. A line segment can see another point if at least one point of the segment can see, or is visible from, that point. We give efficient algorithms for the following three problems: (1) Find a line segment in $P$, if there is, that can see each point of $P$. Such a line segment can be intuitively called a viewer; (2) Preprocess $P$ such that given a query line segment, find out very quickly if it can see each point of $P$; (3) Compute the shortest line segment in $P$, if there is, that can see each point of $P$.Furthermore, we place a set of geometric objects (e.g., points or line segments) in $P$ and require our viewer, which can be either a point or a line segment, to see these objects instead of all points of $P$. Under the assumption that the placed objects do not block the visibility of the viewer, we have obtained fast algorithms for several related problems.The third type of problems is concerned with multi-link paths in simple polygons, a concept that generalizes the notion of visibility into the motion planning area. The link distance between two points inside a simple polygon $P$ is defined to be the minimum number of edges required to form a polygonal path in $P$ that connects the points. We thoroughly explore this notion and investigate several problems of great interest. In particular, we present efficient algorithms for the following problems: (1) Compute the collection of points in $P$ whose maximum link distance to all points of $P$ is minimized over all other points. This collection of points is called the link center of $P$; (2) Preprocess $P$ such that given a point $p$ in $P$, find very quickly a point $q$ of $P$ that is furthest away from $p$ in terms of the link distance. This point $q$ is called a link furthest neighbor of p; (3) Compute a link furthest neighbor for each vertex of $P$;We conclude with a discussion and some open problems." @default.
- W31428279 created "2016-06-24" @default.
- W31428279 creator A5043279947 @default.
- W31428279 date "1990-01-01" @default.
- W31428279 modified "2023-09-23" @default.
- W31428279 title "Polygon visibility algorithms for weak visibility and link distance problems" @default.
- W31428279 hasPublicationYear "1990" @default.
- W31428279 type Work @default.
- W31428279 sameAs 31428279 @default.
- W31428279 citedByCount "6" @default.
- W31428279 crossrefType "journal-article" @default.
- W31428279 hasAuthorship W31428279A5043279947 @default.
- W31428279 hasConcept C111472728 @default.
- W31428279 hasConcept C112680207 @default.
- W31428279 hasConcept C11413529 @default.
- W31428279 hasConcept C114614502 @default.
- W31428279 hasConcept C120665830 @default.
- W31428279 hasConcept C121332964 @default.
- W31428279 hasConcept C123403432 @default.
- W31428279 hasConcept C126042441 @default.
- W31428279 hasConcept C138885662 @default.
- W31428279 hasConcept C1449246 @default.
- W31428279 hasConcept C182124507 @default.
- W31428279 hasConcept C190694206 @default.
- W31428279 hasConcept C197949415 @default.
- W31428279 hasConcept C198352243 @default.
- W31428279 hasConcept C2524010 @default.
- W31428279 hasConcept C2780586882 @default.
- W31428279 hasConcept C28719098 @default.
- W31428279 hasConcept C33923547 @default.
- W31428279 hasConcept C41008148 @default.
- W31428279 hasConcept C59902600 @default.
- W31428279 hasConcept C76155785 @default.
- W31428279 hasConceptScore W31428279C111472728 @default.
- W31428279 hasConceptScore W31428279C112680207 @default.
- W31428279 hasConceptScore W31428279C11413529 @default.
- W31428279 hasConceptScore W31428279C114614502 @default.
- W31428279 hasConceptScore W31428279C120665830 @default.
- W31428279 hasConceptScore W31428279C121332964 @default.
- W31428279 hasConceptScore W31428279C123403432 @default.
- W31428279 hasConceptScore W31428279C126042441 @default.
- W31428279 hasConceptScore W31428279C138885662 @default.
- W31428279 hasConceptScore W31428279C1449246 @default.
- W31428279 hasConceptScore W31428279C182124507 @default.
- W31428279 hasConceptScore W31428279C190694206 @default.
- W31428279 hasConceptScore W31428279C197949415 @default.
- W31428279 hasConceptScore W31428279C198352243 @default.
- W31428279 hasConceptScore W31428279C2524010 @default.
- W31428279 hasConceptScore W31428279C2780586882 @default.
- W31428279 hasConceptScore W31428279C28719098 @default.
- W31428279 hasConceptScore W31428279C33923547 @default.
- W31428279 hasConceptScore W31428279C41008148 @default.
- W31428279 hasConceptScore W31428279C59902600 @default.
- W31428279 hasConceptScore W31428279C76155785 @default.
- W31428279 hasLocation W314282791 @default.
- W31428279 hasOpenAccess W31428279 @default.
- W31428279 hasPrimaryLocation W314282791 @default.
- W31428279 hasRelatedWork W141423351 @default.
- W31428279 hasRelatedWork W1529341441 @default.
- W31428279 hasRelatedWork W1970845672 @default.
- W31428279 hasRelatedWork W19847494 @default.
- W31428279 hasRelatedWork W2007762629 @default.
- W31428279 hasRelatedWork W2032994449 @default.
- W31428279 hasRelatedWork W2033775003 @default.
- W31428279 hasRelatedWork W2093066533 @default.
- W31428279 hasRelatedWork W2132339863 @default.
- W31428279 hasRelatedWork W2153114207 @default.
- W31428279 hasRelatedWork W2157634129 @default.
- W31428279 hasRelatedWork W2174871174 @default.
- W31428279 hasRelatedWork W2261855495 @default.
- W31428279 hasRelatedWork W2278760039 @default.
- W31428279 hasRelatedWork W2396247746 @default.
- W31428279 hasRelatedWork W2731797971 @default.
- W31428279 hasRelatedWork W2937427272 @default.
- W31428279 hasRelatedWork W3026304322 @default.
- W31428279 hasRelatedWork W5989618 @default.
- W31428279 hasRelatedWork W2851486544 @default.
- W31428279 isParatext "false" @default.
- W31428279 isRetracted "false" @default.
- W31428279 magId "31428279" @default.
- W31428279 workType "article" @default.