Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

An algorithm for recognizing palm polygons

From MaRDI portal
Publication:1345480
Jump to:navigation, search

DOI10.1007/BF01910634zbMath0939.68886MaRDI QIDQ1345480

Subir Kumar Ghosh, Anil Maheshwari, C. E. Veni Madhavan, Sudebkumar Prasant Pal

Publication date: 30 March 1995

Published in: The Visual Computer (Search for Journal in Brave)



Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)


Related Items

Recognizing weakly convex visible polygons



Cites Work

  • Characterizing and recognizing weak visibility polygons
  • Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons
  • An optimal visibility graph algorithm for triangulated simple polygons
  • On geodesic properties of polygons relevant to linear time triangulation
  • Triangulating a simple polygon in linear time
  • Computing the visibility polygon from a convex set and related problems
Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1345480&oldid=13479941"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 31 January 2024, at 14:46.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki