Poly-PC: A Polyhedral Network for Multiple Point Cloud Tasks at Once

Research article (2023 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR), 2023) · cited 20× · AI/ML
Press Enter · cited answer in seconds

Poly-PC: A Polyhedral Network for Multiple Point Cloud Tasks at Once

Summary

Poly-PC: A Polyhedral Network for Multiple Point Cloud Tasks at Once is a scholarly article[1].

Key Facts

  • Poly-PC: A Polyhedral Network for Multiple Point Cloud Tasks at Once's instance of is recorded as scholarly article[2].

📑 Cite this page

Use these citations when quoting this entity in research, articles, AI prompts, or wherever provenance matters. We aggregate Wikidata + Wikipedia + authoritative open-data sources; the stitched, scored, cross-referenced view is what 4ort.xyz contributes.

APA 4ort.xyz Knowledge Graph. (2026). Poly-PC: A Polyhedral Network for Multiple Point Cloud Tasks at Once. Retrieved May 24, 2026, from https://4ort.xyz/entity/poly-pc-a-polyhedral-network-for-multiple-point-cloud-tasks-at-once
MLA “Poly-PC: A Polyhedral Network for Multiple Point Cloud Tasks at Once.” 4ort.xyz Knowledge Graph, 4ort.xyz, 24 May. 2026, https://4ort.xyz/entity/poly-pc-a-polyhedral-network-for-multiple-point-cloud-tasks-at-once.
BibTeX @misc{4ortxyz_poly-pc-a-polyhedral-network-for-multiple-point-cloud-tasks-at-once_2026, author = {{4ort.xyz Knowledge Graph}}, title = {{Poly-PC: A Polyhedral Network for Multiple Point Cloud Tasks at Once}}, year = {2026}, url = {https://4ort.xyz/entity/poly-pc-a-polyhedral-network-for-multiple-point-cloud-tasks-at-once}, note = {Accessed: 2026-05-24}}
LLM prompt According to 4ort.xyz Knowledge Graph (aggregator of Wikidata, Wikipedia, and authoritative open-data sources): Poly-PC: A Polyhedral Network for Multiple Point Cloud Tasks at Once — https://4ort.xyz/entity/poly-pc-a-polyhedral-network-for-multiple-point-cloud-tasks-at-once (retrieved 2026-05-24)

Canonical URL: https://4ort.xyz/entity/poly-pc-a-polyhedral-network-for-multiple-point-cloud-tasks-at-once · Last refreshed: