Typed states for the displayed outbound observations.
Source: paper_references, paper_reference_links, observed 2026-08-07T10:40:12.395852Z
Paper Citation Record · LEDGER
A Fast Unsupervised Scheme for Polygonal Approximation
As of 7 August 2026, this Paper Citation Record lists 23 of 23 outbound references and 0 inbound Pith citation observations for arXiv:2506.04664.
A citation records a reference. It does not transfer a finding from one paper to another.
Coverage vector
One-hop event checks from named stored sources.
Source: scholarly_work_events, retraction_status_cache, observed 2026-08-07T06:34:17.273281+00:00
Pith citing papers itemized under the disclosed page cap.
Source: paper_references, paper_reference_links
A source-named dated measurement, never combined with another source.
Source: cited_works
Reference resolution
23 of 23 outbound references displayed
- verified exact0
- verified fuzzy23
- unresolved0
- parse uncertain0
- malformed identifier0
- metadata mismatch0
External citation measurements
No source-named external measurement is stored.
Outbound references
Observation 2711808d-6110-4c63-965c-cfd7394629fd · outbound
This paper cites An iterative procedure for the polygonal approximation of plane curves.
A Fast Unsupervised Scheme for Polygonal Approximation An iterative procedure for the polygonal approximation of plane curves
Reference 1
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-07T10:40:17.374377Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.
Observation a55b337d-e65a-4feb-9c6a-8e3d29f37fe5 · outbound
This paper cites Algorithms for the reduction of the number of points required to represent a digitized line or its caricature.
A Fast Unsupervised Scheme for Polygonal Approximation Algorithms for the reduction of the number of points required to represent a digitized line or its caricature
Reference 2
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-07T10:40:17.078973Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.
Observation a2b5ff4c-8150-45e3-bac3-6376778d649b · outbound
This paper cites A new thresholding approach for automatic generation of polygonal approximations.
A Fast Unsupervised Scheme for Polygonal Approximation A new thresholding approach for automatic generation of polygonal approximations
Reference 3
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-07T10:40:16.790330Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.
Observation 097cd4f8-11d2-4bd8-99e3-0a3f8213b409 · outbound
This paper cites Optimized polygonal approximation by dominant point deletion.
A Fast Unsupervised Scheme for Polygonal Approximation Optimized polygonal approximation by dominant point deletion
Reference 4
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-07T10:40:16.408023Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.
Observation 60c5bb9d-9f6d-4410-9e91-21707e448eb7 · outbound
This paper cites An efficient unsupervised method for obtaining polygonal approximations of closed digital planar curves.
A Fast Unsupervised Scheme for Polygonal Approximation An efficient unsupervised method for obtaining polygonal approximations of closed digital planar curves
Reference 5
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-07T10:40:16.313984Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.
Observation 9e61f924-bdd2-4d04-afdb-e4226fa8bc94 · outbound
This paper cites Segmentation of plane curves.
A Fast Unsupervised Scheme for Polygonal Approximation Segmentation of plane curves
Reference 6
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-07T10:40:16.140574Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.
Observation 4c8c30ac-3a3f-413f-b619-28b307933ac4 · outbound
This paper cites Optimum polygonal approximation of digitized curves.
A Fast Unsupervised Scheme for Polygonal Approximation Optimum polygonal approximation of digitized curves
Reference 7
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-07T10:40:15.907835Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.
Observation 41ac5a08-428e-49d3-bf2d-8be7c9328fa2 · outbound
This paper cites Techniques for assessing polygonal approximations of curves.
A Fast Unsupervised Scheme for Polygonal Approximation Techniques for assessing polygonal approximations of curves
Reference 8
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-07T10:40:15.724908Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.
Observation 3b82fbf3-a448-4b32-b114-ce3d35a397a5 · outbound
This paper cites An efficient algorithm for piecewise linear approximation of planar curve s.
A Fast Unsupervised Scheme for Polygonal Approximation An efficient algorithm for piecewise linear approximation of planar curve s
Reference 9
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-07T10:40:15.545341Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.
Observation 31c5f8af-e625-47a7-bff8-a2bdf2cc3e53 · outbound
This paper cites A fast sequential method for polygonal approximation of digitized curves.
A Fast Unsupervised Scheme for Polygonal Approximation A fast sequential method for polygonal approximation of digitized curves
Reference 10
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-07T10:40:15.339987Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.
Observation db58c0b5-4d31-4c47-a928-418374c336d0 · outbound
This paper cites An algorithm for polygonal approximation based on iterative point elimination.
A Fast Unsupervised Scheme for Polygonal Approximation An algorithm for polygonal approximation based on iterative point elimination
Reference 11
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-07T10:40:15.204526Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.
Observation 942c5ad1-5638-46db-a740-8d6cc98ad093 · outbound
This paper cites Line generalization by repeated elimination of points.
A Fast Unsupervised Scheme for Polygonal Approximation Line generalization by repeated elimination of points
Reference 12
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-07T10:40:15.023709Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.
Observation 02694af3-f002-49c7-81a6-0ebdfec33e24 · outbound
This paper cites Dominant point deletion by reverse polygonization of digital curves.
A Fast Unsupervised Scheme for Polygonal Approximation Dominant point deletion by reverse polygonization of digital curves
Reference 13
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-07T10:40:14.868158Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.
Observation ebe2dbbb-8d0d-4754-92c8-dbe3d0528ca4 · outbound
This paper cites Polygonal approximation of digital planar curves through break point suppression.
A Fast Unsupervised Scheme for Polygonal Approximation Polygonal approximation of digital planar curves through break point suppression
Reference 14
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-07T10:40:14.712479Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.
Observation 4e788b11-0420-4d28-bccd-8568aee59b9f · outbound
This paper cites On stop conditions about methods to obtain polygonal approximations relied on break point suppression.
A Fast Unsupervised Scheme for Polygonal Approximation On stop conditions about methods to obtain polygonal approximations relied on break point suppression
Reference 15
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-07T10:40:14.442817Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.
Observation 66e297b3-10b1-4438-927c-54cb32a09fab · outbound
This paper cites The computation of polygonal approximations for 2D contours based on a concavity tree.
A Fast Unsupervised Scheme for Polygonal Approximation The computation of polygonal approximations for 2D contours based on a concavity tree
Reference 16
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-07T10:40:14.161406Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.
Observation 0f30f996-c8c2-4dc1-a5fd-8c8b1f92485d · outbound
This paper cites A novel framework for making dominant point detection methods non-parametric.
A Fast Unsupervised Scheme for Polygonal Approximation A novel framework for making dominant point detection methods non-parametric
Reference 17
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-07T10:40:13.886502Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.
Observation 0d6e2585-de5b-4f3f-b11c-eb3be1ab605a · outbound
This paper cites Unsupervised generation of polygonal approximations based on the convex hull.
A Fast Unsupervised Scheme for Polygonal Approximation Unsupervised generation of polygonal approximations based on the convex hull
Reference 18
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-07T10:40:13.527320Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.
Observation 7da59bbe-3d98-42be-a443-74103d70fe69 · outbound
This paper cites Polygonal approximation of digita l planar curves through adaptive optimizations.
A Fast Unsupervised Scheme for Polygonal Approximation Polygonal approximation of digita l planar curves through adaptive optimizations
Reference 19
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-07T10:40:13.289953Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.
Observation 9d15d0ea-075e-48ec-b892-ef77d6616cc1 · outbound
This paper cites Optimized polygonal approximation s through vertex relocations in contour neighborhoods.
A Fast Unsupervised Scheme for Polygonal Approximation Optimized polygonal approximation s through vertex relocations in contour neighborhoods
Reference 20
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-07T10:40:13.071318Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.
Observation 54b2b3d6-813e-4187-9269-65185e133cc9 · outbound
This paper cites A simple algorithm for detection of significant vertices for polygonal approximation of chain -coded curves.
A Fast Unsupervised Scheme for Polygonal Approximation A simple algorithm for detection of significant vertices for polygonal approximation of chain -coded curves
Reference 21
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-07T10:40:12.884515Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.
Observation be64a107-c817-4842-bb9c-f0a326848a3e · outbound
This paper cites Some algorithms under non -parametric framework versus an unsupervised approach.
A Fast Unsupervised Scheme for Polygonal Approximation Some algorithms under non -parametric framework versus an unsupervised approach
Reference 23
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-07T10:40:12.728133Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.
Observation 51333ed0-6bcd-414b-a75c-c869d174e681 · outbound
This paper cites Near-convex decomposition of 2D shape using visibility range.
A Fast Unsupervised Scheme for Polygonal Approximation Near-convex decomposition of 2D shape using visibility range
Reference 24
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-07T10:40:12.569790Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.
Pith citing papers
No inbound Pith citation observations are available.