{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:EAIQL5O6GZLQGBQ5SLIU7YBN53","short_pith_number":"pith:EAIQL5O6","schema_version":"1.0","canonical_sha256":"201105f5de365703061d92d14fe02deec3f44b9bbfe3f23d6c68468b2a243c77","source":{"kind":"arxiv","id":"1109.0389","version":1},"attestation_state":"computed","paper":{"title":"A Space-Optimal Hidden Surface Removal Algorithm for Iso-Oriented Rectangles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Athanasios Tsakalidis, Kostas Tsichlas","submitted_at":"2011-09-02T09:16:09Z","abstract_excerpt":"We investigate the problem of finding the visible pieces of a scene of objects from a specified viewpoint. In particular, we are interested in the design of an efficient hidden surface removal algorithm for a scene comprised of iso-oriented rectangles. We propose an algorithm where given a set of $n$ iso-oriented rectangles we report all visible surfaces in $O((n+k)\\log n)$ time and linear space, where $k$ is the number of surfaces reported. The previous best result by Bern, has the same time complexity but uses $O(n\\log n)$ space."},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1109.0389","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2011-09-02T09:16:09Z","cross_cats_sorted":[],"title_canon_sha256":"a359b21ae4e2392fd581a728e88c540ce644f604bda7c902137455964feab1b7","abstract_canon_sha256":"77684b7891883391213f8b4c02c91d12f623358bf9615069ae2225ad5f58dd18"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:14:15.795199Z","signature_b64":"IxtbMIaqQC49Z0I9SXfmPi449FqGeHAEsVFMxdH6VzeDy/+PH5tki4aZua5DgakRpOPV/uWlaEiHPohrvGbDBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"201105f5de365703061d92d14fe02deec3f44b9bbfe3f23d6c68468b2a243c77","last_reissued_at":"2026-05-18T04:14:15.794545Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:14:15.794545Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Space-Optimal Hidden Surface Removal Algorithm for Iso-Oriented Rectangles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Athanasios Tsakalidis, Kostas Tsichlas","submitted_at":"2011-09-02T09:16:09Z","abstract_excerpt":"We investigate the problem of finding the visible pieces of a scene of objects from a specified viewpoint. In particular, we are interested in the design of an efficient hidden surface removal algorithm for a scene comprised of iso-oriented rectangles. We propose an algorithm where given a set of $n$ iso-oriented rectangles we report all visible surfaces in $O((n+k)\\log n)$ time and linear space, where $k$ is the number of surfaces reported. The previous best result by Bern, has the same time complexity but uses $O(n\\log n)$ space."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1109.0389","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"1109.0389","created_at":"2026-05-18T04:14:15.794645+00:00"},{"alias_kind":"arxiv_version","alias_value":"1109.0389v1","created_at":"2026-05-18T04:14:15.794645+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1109.0389","created_at":"2026-05-18T04:14:15.794645+00:00"},{"alias_kind":"pith_short_12","alias_value":"EAIQL5O6GZLQ","created_at":"2026-05-18T12:26:26.731475+00:00"},{"alias_kind":"pith_short_16","alias_value":"EAIQL5O6GZLQGBQ5","created_at":"2026-05-18T12:26:26.731475+00:00"},{"alias_kind":"pith_short_8","alias_value":"EAIQL5O6","created_at":"2026-05-18T12:26:26.731475+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/EAIQL5O6GZLQGBQ5SLIU7YBN53","json":"https://pith.science/pith/EAIQL5O6GZLQGBQ5SLIU7YBN53.json","graph_json":"https://pith.science/api/pith-number/EAIQL5O6GZLQGBQ5SLIU7YBN53/graph.json","events_json":"https://pith.science/api/pith-number/EAIQL5O6GZLQGBQ5SLIU7YBN53/events.json","paper":"https://pith.science/paper/EAIQL5O6"},"agent_actions":{"view_html":"https://pith.science/pith/EAIQL5O6GZLQGBQ5SLIU7YBN53","download_json":"https://pith.science/pith/EAIQL5O6GZLQGBQ5SLIU7YBN53.json","view_paper":"https://pith.science/paper/EAIQL5O6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1109.0389&json=true","fetch_graph":"https://pith.science/api/pith-number/EAIQL5O6GZLQGBQ5SLIU7YBN53/graph.json","fetch_events":"https://pith.science/api/pith-number/EAIQL5O6GZLQGBQ5SLIU7YBN53/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EAIQL5O6GZLQGBQ5SLIU7YBN53/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EAIQL5O6GZLQGBQ5SLIU7YBN53/action/storage_attestation","attest_author":"https://pith.science/pith/EAIQL5O6GZLQGBQ5SLIU7YBN53/action/author_attestation","sign_citation":"https://pith.science/pith/EAIQL5O6GZLQGBQ5SLIU7YBN53/action/citation_signature","submit_replication":"https://pith.science/pith/EAIQL5O6GZLQGBQ5SLIU7YBN53/action/replication_record"}},"created_at":"2026-05-18T04:14:15.794645+00:00","updated_at":"2026-05-18T04:14:15.794645+00:00"}