No label defined (Q5088939)

From MaRDI portal

Jump to:navigation, search

scientific article; zbMATH DE number 7559212

Language	Label	Description	Also known as
English	No label defined	scientific article; zbMATH DE number 7559212

Statements

scholarly article

0 references

publication date

18 July 2022

0 references

zbMATH Keywords

geodesic distance

0 references

simple polygons

0 references

farthest-point Voronoi diagram

0 references

0 references

MaRDI profile type

MaRDI publication profile

0 references

A linear-time algorithm for the geodesic center of a simple polygon

0 references

On the geodesic Voronoi diagram of point sites in a simple polygon

0 references

The furthest-site geodesic Voronoi diagram

0 references

Detecting Weakly Simple Polygons

0 references

Triangulating a simple polygon in linear time

0 references

0 references

Simulation of simplicity: a technique to cope with degenerate cases in geometric algorithms

0 references

Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons

0 references

Matrix Searching with the Shortest-Path Metric

0 references

0 references

0 references

Optimal Algorithm for Geodesic Nearest-point Voronoi Diagrams in Simple Polygons

0 references

0 references

Computing a geodesic two-center of points in a simple polygon

0 references

The farthest-point geodesic Voronoi diagram of points on the boundary of a simple polygon

0 references

k-PAIRS NON-CROSSING SHORTEST PATHS IN A SIMPLE POLYGON

0 references

Computing the geodesic center of a simple polygon

0 references

Computing geodesic furthest neighbors in simple polygons

0 references

Identifiers

10.4230/LIPIcs.SoCG.2019.12

0 references

Mathematics Subject Classification ID

0 references

zbMATH DE Number

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:5088939

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q5088939&oldid=36831093"